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.r289-tajo-171654445500227.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K May 18 16:43 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 PolyORBLF-PT-S02J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716859669304

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:27:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 01:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:27:52] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-28 01:27:52] [INFO ] Transformed 614 places.
[2024-05-28 01:27:52] [INFO ] Transformed 1242 transitions.
[2024-05-28 01:27:52] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 219 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 606 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 606 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 598 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 598 transition count 1098
Applied a total of 32 rules in 218 ms. Remains 598 /614 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:27:53] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 598 cols
[2024-05-28 01:27:53] [INFO ] Computed 50 invariants in 86 ms
[2024-05-28 01:27:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:28:07] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 29 ms to minimize.
[2024-05-28 01:28:07] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 4 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:28:09] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-28 01:28:09] [INFO ] Deduced a trap composed of 159 places in 434 ms of which 4 ms to minimize.
[2024-05-28 01:28:10] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:28:10] [INFO ] Deduced a trap composed of 406 places in 321 ms of which 5 ms to minimize.
[2024-05-28 01:28:12] [INFO ] Deduced a trap composed of 318 places in 463 ms of which 6 ms to minimize.
[2024-05-28 01:28:12] [INFO ] Deduced a trap composed of 269 places in 365 ms of which 5 ms to minimize.
[2024-05-28 01:28:14] [INFO ] Deduced a trap composed of 283 places in 438 ms of which 5 ms to minimize.
[2024-05-28 01:28:16] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 5 ms to minimize.
SMT process timed out in 22983ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 23079ms
[2024-05-28 01:28:16] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:28:16] [INFO ] Invariant cache hit.
[2024-05-28 01:28:17] [INFO ] Implicit Places using invariants in 479 ms returned [108, 181, 288, 300, 420, 488, 517, 529]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 490 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 590/614 places, 1098/1114 transitions.
Applied a total of 0 rules in 27 ms. Remains 590 /590 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23950 ms. Remains : 590/614 places, 1098/1114 transitions.
Support contains 219 out of 590 places after structural reductions.
[2024-05-28 01:28:17] [INFO ] Flatten gal took : 209 ms
[2024-05-28 01:28:17] [INFO ] Flatten gal took : 119 ms
[2024-05-28 01:28:18] [INFO ] Input system was already deterministic with 1098 transitions.
Support contains 179 out of 590 places (down from 219) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2079 ms. (19 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40002 steps (9 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (16 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
[2024-05-28 01:28:19] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 590 cols
[2024-05-28 01:28:19] [INFO ] Computed 42 invariants in 29 ms
[2024-05-28 01:28:19] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 274/382 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/393 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 587/1672 variables, and 40 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1225ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(p1)&&F(G(p2)))))'
Support contains 19 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 32 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:28:21] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 01:28:21] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 01:28:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:28:32] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:28:33] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:28:34] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:28:34] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:28:34] [INFO ] Deduced a trap composed of 114 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:28:35] [INFO ] Deduced a trap composed of 162 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:28:35] [INFO ] Deduced a trap composed of 406 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:28:36] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:28:37] [INFO ] Deduced a trap composed of 300 places in 342 ms of which 4 ms to minimize.
[2024-05-28 01:28:38] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 3 ms to minimize.
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 299 places in 355 ms of which 6 ms to minimize.
[2024-05-28 01:28:40] [INFO ] Deduced a trap composed of 269 places in 274 ms of which 3 ms to minimize.
[2024-05-28 01:28:41] [INFO ] Deduced a trap composed of 323 places in 361 ms of which 5 ms to minimize.
[2024-05-28 01:28:41] [INFO ] Deduced a trap composed of 339 places in 291 ms of which 5 ms to minimize.
[2024-05-28 01:28:42] [INFO ] Deduced a trap composed of 305 places in 320 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 6)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 4)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 9)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41782ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41797ms
[2024-05-28 01:29:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:29:03] [INFO ] Invariant cache hit.
[2024-05-28 01:29:03] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-28 01:29:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:29:03] [INFO ] Invariant cache hit.
[2024-05-28 01:29:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:29:11] [INFO ] Implicit Places using invariants and state equation in 8152 ms returned []
Implicit Place search using SMT with State Equation took 8815 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:29:11] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:29:11] [INFO ] Invariant cache hit.
[2024-05-28 01:29:11] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:29:23] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 01:29:25] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:29:25] [INFO ] Deduced a trap composed of 162 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:29:26] [INFO ] Deduced a trap composed of 396 places in 339 ms of which 6 ms to minimize.
[2024-05-28 01:29:26] [INFO ] Deduced a trap composed of 394 places in 269 ms of which 4 ms to minimize.
[2024-05-28 01:29:27] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 2 ms to minimize.
[2024-05-28 01:29:28] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 5 ms to minimize.
[2024-05-28 01:29:28] [INFO ] Deduced a trap composed of 269 places in 318 ms of which 7 ms to minimize.
[2024-05-28 01:29:29] [INFO ] Deduced a trap composed of 269 places in 348 ms of which 5 ms to minimize.
[2024-05-28 01:29:32] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 5 ms to minimize.
[2024-05-28 01:29:32] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 4 ms to minimize.
[2024-05-28 01:29:33] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:30:05] [INFO ] Deduced a trap composed of 375 places in 414 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61532ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61554ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112211 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 620 ms.
Product exploration explored 100000 steps with 50000 reset in 481 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 37 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-00 finished in 113871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 24 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 14 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:30:15] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:30:15] [INFO ] Invariant cache hit.
[2024-05-28 01:30:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 6 ms to minimize.
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-28 01:30:29] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 01:30:30] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-28 01:30:30] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:30:30] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:30:31] [INFO ] Deduced a trap composed of 162 places in 419 ms of which 9 ms to minimize.
[2024-05-28 01:30:31] [INFO ] Deduced a trap composed of 396 places in 283 ms of which 5 ms to minimize.
[2024-05-28 01:30:31] [INFO ] Deduced a trap composed of 394 places in 272 ms of which 4 ms to minimize.
[2024-05-28 01:30:32] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 2 ms to minimize.
[2024-05-28 01:30:33] [INFO ] Deduced a trap composed of 326 places in 270 ms of which 3 ms to minimize.
[2024-05-28 01:30:33] [INFO ] Deduced a trap composed of 269 places in 304 ms of which 5 ms to minimize.
[2024-05-28 01:30:34] [INFO ] Deduced a trap composed of 269 places in 240 ms of which 4 ms to minimize.
[2024-05-28 01:30:36] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 4 ms to minimize.
SMT process timed out in 21862ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21874ms
[2024-05-28 01:30:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:30:36] [INFO ] Invariant cache hit.
[2024-05-28 01:30:37] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-28 01:30:37] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:30:37] [INFO ] Invariant cache hit.
[2024-05-28 01:30:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:30:48] [INFO ] Implicit Places using invariants and state equation in 10795 ms returned []
Implicit Place search using SMT with State Equation took 11281 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:30:48] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:30:48] [INFO ] Invariant cache hit.
[2024-05-28 01:30:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 01:31:01] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 3 ms to minimize.
[2024-05-28 01:31:02] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:31:02] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 5 ms to minimize.
[2024-05-28 01:31:03] [INFO ] Deduced a trap composed of 396 places in 339 ms of which 4 ms to minimize.
[2024-05-28 01:31:03] [INFO ] Deduced a trap composed of 394 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:31:04] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:31:04] [INFO ] Deduced a trap composed of 326 places in 330 ms of which 4 ms to minimize.
[2024-05-28 01:31:05] [INFO ] Deduced a trap composed of 269 places in 335 ms of which 4 ms to minimize.
[2024-05-28 01:31:06] [INFO ] Deduced a trap composed of 269 places in 310 ms of which 4 ms to minimize.
[2024-05-28 01:31:08] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 5 ms to minimize.
[2024-05-28 01:31:08] [INFO ] Deduced a trap composed of 302 places in 343 ms of which 4 ms to minimize.
[2024-05-28 01:31:09] [INFO ] Deduced a trap composed of 294 places in 263 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:31:41] [INFO ] Deduced a trap composed of 375 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61447ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61460ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94637 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 6859 reset in 410 ms.
Product exploration explored 100000 steps with 6871 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:31:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:31:51] [INFO ] Invariant cache hit.
[2024-05-28 01:31:52] [INFO ] [Real]Absence check using 16 positive place invariants in 52 ms returned sat
[2024-05-28 01:31:52] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 137 ms returned sat
[2024-05-28 01:31:54] [INFO ] [Real]Absence check using state equation in 2039 ms returned sat
[2024-05-28 01:31:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:31:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-28 01:31:55] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 35 ms returned sat
[2024-05-28 01:31:59] [INFO ] [Nat]Absence check using state equation in 4242 ms returned sat
[2024-05-28 01:31:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:32:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 01:32:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 1960 ms returned sat
[2024-05-28 01:32:01] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:32:01] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-28 01:32:02] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:32:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 965 ms
[2024-05-28 01:32:02] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 118 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 01:32:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 24 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 540 transition count 1002
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 492 transition count 1002
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 326 place count 422 transition count 932
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 422 transition count 932
Applied a total of 332 rules in 130 ms. Remains 422 /588 variables (removed 166) and now considering 932/1098 (removed 166) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 01:32:09] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-05-28 01:32:09] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 01:32:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 187 places in 242 ms of which 4 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 4 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:32:19] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:32:20] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:32:20] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:32:21] [INFO ] Deduced a trap composed of 222 places in 243 ms of which 4 ms to minimize.
[2024-05-28 01:32:21] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:32:26] [INFO ] Deduced a trap composed of 175 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:32:26] [INFO ] Deduced a trap composed of 181 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:32:27] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:32:27] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:32:28] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
(s405 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 8.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 1.0)
(s175 0.0)
(s176 2.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 9.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 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.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 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 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 (/ 2.0 3.0))
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 (/ 1.0 3.0))
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 (/ 1.0 3.0))
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 60 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:32:48] [INFO ] Deduced a trap composed of 193 places in 260 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 61 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 23/23 constraints]
After SMT, in 41662ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41674ms
[2024-05-28 01:32:51] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:32:51] [INFO ] Invariant cache hit.
[2024-05-28 01:32:51] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-28 01:32:51] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:32:51] [INFO ] Invariant cache hit.
[2024-05-28 01:32:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:32:58] [INFO ] Implicit Places using invariants and state equation in 6995 ms returned []
Implicit Place search using SMT with State Equation took 7534 ms to find 0 implicit places.
[2024-05-28 01:32:58] [INFO ] Redundant transitions in 82 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 01:32:58] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:32:58] [INFO ] Invariant cache hit.
[2024-05-28 01:32:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:33:05] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:33:05] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:33:05] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 4 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:33:06] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 10 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:33:13] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:33:13] [INFO ] Deduced a trap composed of 238 places in 222 ms of which 4 ms to minimize.
[2024-05-28 01:33:13] [INFO ] Deduced a trap composed of 192 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:33:14] [INFO ] Deduced a trap composed of 195 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 4 ms to minimize.
[2024-05-28 01:33:22] [INFO ] Deduced a trap composed of 178 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:33:22] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:33:29] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:33:41] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 63 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 25/25 constraints]
After SMT, in 61441ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/588 places, 932/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110885 ms. Remains : 422/588 places, 932/1098 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 47 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:34:00] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:34:00] [INFO ] Invariant cache hit.
[2024-05-28 01:34:01] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 01:34:01] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 28 ms returned sat
[2024-05-28 01:34:02] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2024-05-28 01:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:34:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 01:34:02] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 42 ms returned sat
[2024-05-28 01:34:03] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2024-05-28 01:34:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:34:04] [INFO ] [Nat]Added 96 Read/Feed constraints in 1038 ms returned sat
[2024-05-28 01:34:05] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 3 ms to minimize.
[2024-05-28 01:34:05] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:34:05] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:34:06] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:34:06] [INFO ] Deduced a trap composed of 186 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:34:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1707 ms
[2024-05-28 01:34:06] [INFO ] Computed and/alt/rep : 404/1417/396 causal constraints (skipped 518 transitions) in 67 ms.
[2024-05-28 01:34:09] [INFO ] Added : 144 causal constraints over 29 iterations in 3092 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7557 reset in 434 ms.
Product exploration explored 100000 steps with 7572 reset in 433 ms.
Support contains 24 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 932/932 transitions.
Applied a total of 0 rules in 23 ms. Remains 422 /422 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 01:34:10] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:34:10] [INFO ] Invariant cache hit.
[2024-05-28 01:34:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:34:17] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:34:17] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:34:17] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:34:17] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:34:17] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:34:18] [INFO ] Deduced a trap composed of 242 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:34:19] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:34:19] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2024-05-28 01:34:20] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 2 ms to minimize.
[2024-05-28 01:34:24] [INFO ] Deduced a trap composed of 157 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:34:24] [INFO ] Deduced a trap composed of 238 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:34:25] [INFO ] Deduced a trap composed of 192 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:34:25] [INFO ] Deduced a trap composed of 195 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:34:31] [INFO ] Deduced a trap composed of 171 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 59 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:34:46] [INFO ] Deduced a trap composed of 193 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:34:48] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 3 ms to minimize.
[2024-05-28 01:34:48] [INFO ] Deduced a trap composed of 194 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 24/24 constraints]
After SMT, in 41386ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41397ms
[2024-05-28 01:34:52] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:34:52] [INFO ] Invariant cache hit.
[2024-05-28 01:34:52] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-28 01:34:52] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:34:52] [INFO ] Invariant cache hit.
[2024-05-28 01:34:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:34:59] [INFO ] Implicit Places using invariants and state equation in 6905 ms returned []
Implicit Place search using SMT with State Equation took 7363 ms to find 0 implicit places.
[2024-05-28 01:34:59] [INFO ] Redundant transitions in 44 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 01:34:59] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:34:59] [INFO ] Invariant cache hit.
[2024-05-28 01:34:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:35:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:35:06] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 3 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-05-28 01:35:07] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:35:08] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:35:09] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:35:09] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:35:14] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:35:14] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 4 ms to minimize.
[2024-05-28 01:35:14] [INFO ] Deduced a trap composed of 192 places in 209 ms of which 3 ms to minimize.
[2024-05-28 01:35:15] [INFO ] Deduced a trap composed of 195 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:35:21] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:35:22] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:35:23] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:35:29] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:35:42] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 63 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 25/25 constraints]
After SMT, in 61618ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110476 ms. Remains : 422/422 places, 932/932 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-02 finished in 346432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 31 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:36:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 01:36:01] [INFO ] Computed 40 invariants in 13 ms
[2024-05-28 01:36:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:36:11] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 2 ms to minimize.
[2024-05-28 01:36:12] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:36:13] [INFO ] Deduced a trap composed of 114 places in 251 ms of which 3 ms to minimize.
[2024-05-28 01:36:13] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 4 ms to minimize.
[2024-05-28 01:36:13] [INFO ] Deduced a trap composed of 406 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:36:14] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-28 01:36:15] [INFO ] Deduced a trap composed of 300 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:36:16] [INFO ] Deduced a trap composed of 294 places in 229 ms of which 3 ms to minimize.
[2024-05-28 01:36:17] [INFO ] Deduced a trap composed of 299 places in 268 ms of which 4 ms to minimize.
[2024-05-28 01:36:17] [INFO ] Deduced a trap composed of 269 places in 231 ms of which 4 ms to minimize.
[2024-05-28 01:36:18] [INFO ] Deduced a trap composed of 323 places in 244 ms of which 4 ms to minimize.
[2024-05-28 01:36:18] [INFO ] Deduced a trap composed of 339 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:36:18] [INFO ] Deduced a trap composed of 305 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 (/ 1.0 3.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 10.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 6.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 (/ 2.0 3.0))
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.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 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 (/ 2.0 3.0))
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.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 4.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.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 10.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 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41401ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41423ms
[2024-05-28 01:36:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:36:42] [INFO ] Invariant cache hit.
[2024-05-28 01:36:43] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-28 01:36:43] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:36:43] [INFO ] Invariant cache hit.
[2024-05-28 01:36:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:36:50] [INFO ] Implicit Places using invariants and state equation in 7478 ms returned []
Implicit Place search using SMT with State Equation took 7982 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:36:50] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:36:50] [INFO ] Invariant cache hit.
[2024-05-28 01:36:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 01:37:02] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-28 01:37:03] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:37:03] [INFO ] Deduced a trap composed of 162 places in 331 ms of which 4 ms to minimize.
[2024-05-28 01:37:04] [INFO ] Deduced a trap composed of 396 places in 270 ms of which 4 ms to minimize.
[2024-05-28 01:37:04] [INFO ] Deduced a trap composed of 394 places in 248 ms of which 3 ms to minimize.
[2024-05-28 01:37:05] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:37:05] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 5 ms to minimize.
[2024-05-28 01:37:05] [INFO ] Deduced a trap composed of 269 places in 258 ms of which 4 ms to minimize.
[2024-05-28 01:37:07] [INFO ] Deduced a trap composed of 269 places in 332 ms of which 4 ms to minimize.
[2024-05-28 01:37:09] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 4 ms to minimize.
[2024-05-28 01:37:10] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 4 ms to minimize.
[2024-05-28 01:37:10] [INFO ] Deduced a trap composed of 294 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:37:42] [INFO ] Deduced a trap composed of 375 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61233ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61242ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110688 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-05 finished in 110843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 19 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:37:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 01:37:52] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 01:37:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:38:02] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:38:02] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-28 01:38:02] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:38:02] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:38:02] [INFO ] Deduced a trap composed of 183 places in 268 ms of which 3 ms to minimize.
[2024-05-28 01:38:03] [INFO ] Deduced a trap composed of 394 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:38:03] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 4 ms to minimize.
[2024-05-28 01:38:04] [INFO ] Deduced a trap composed of 295 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:38:04] [INFO ] Deduced a trap composed of 300 places in 225 ms of which 3 ms to minimize.
[2024-05-28 01:38:04] [INFO ] Deduced a trap composed of 276 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:38:06] [INFO ] Deduced a trap composed of 386 places in 316 ms of which 5 ms to minimize.
[2024-05-28 01:38:07] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:38:07] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-05-28 01:38:07] [INFO ] Deduced a trap composed of 384 places in 275 ms of which 5 ms to minimize.
[2024-05-28 01:38:08] [INFO ] Deduced a trap composed of 294 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:38:08] [INFO ] Deduced a trap composed of 308 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41269ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41282ms
[2024-05-28 01:38:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:38:33] [INFO ] Invariant cache hit.
[2024-05-28 01:38:34] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-28 01:38:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:38:34] [INFO ] Invariant cache hit.
[2024-05-28 01:38:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:38:42] [INFO ] Implicit Places using invariants and state equation in 8326 ms returned []
Implicit Place search using SMT with State Equation took 8754 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:38:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:38:42] [INFO ] Invariant cache hit.
[2024-05-28 01:38:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:38:52] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:38:53] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-28 01:38:53] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:38:53] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:38:54] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 4 ms to minimize.
[2024-05-28 01:38:54] [INFO ] Deduced a trap composed of 394 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:38:55] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 3 ms to minimize.
[2024-05-28 01:38:56] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 4 ms to minimize.
[2024-05-28 01:38:57] [INFO ] Deduced a trap composed of 303 places in 294 ms of which 4 ms to minimize.
[2024-05-28 01:38:58] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-28 01:38:58] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 4 ms to minimize.
[2024-05-28 01:39:00] [INFO ] Deduced a trap composed of 311 places in 312 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:39:12] [INFO ] Deduced a trap composed of 114 places in 307 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 56 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:39:30] [INFO ] Deduced a trap composed of 367 places in 250 ms of which 3 ms to minimize.
[2024-05-28 01:39:33] [INFO ] Deduced a trap composed of 376 places in 278 ms of which 3 ms to minimize.
[2024-05-28 01:39:39] [INFO ] Deduced a trap composed of 311 places in 319 ms of which 4 ms to minimize.
[2024-05-28 01:39:40] [INFO ] Deduced a trap composed of 340 places in 340 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 61702ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61711ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111773 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-06 finished in 112833 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||G(p1))) U X(X((p2 U X(p3))))))'
Support contains 56 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 14 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:39:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 01:39:45] [INFO ] Computed 40 invariants in 31 ms
[2024-05-28 01:39:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:39:56] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-05-28 01:39:56] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 01:39:56] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:39:56] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:39:57] [INFO ] Deduced a trap composed of 114 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:39:58] [INFO ] Deduced a trap composed of 162 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:39:58] [INFO ] Deduced a trap composed of 406 places in 310 ms of which 5 ms to minimize.
[2024-05-28 01:39:59] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2024-05-28 01:39:59] [INFO ] Deduced a trap composed of 300 places in 343 ms of which 4 ms to minimize.
[2024-05-28 01:40:00] [INFO ] Deduced a trap composed of 294 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:40:01] [INFO ] Deduced a trap composed of 299 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:40:02] [INFO ] Deduced a trap composed of 269 places in 300 ms of which 3 ms to minimize.
[2024-05-28 01:40:03] [INFO ] Deduced a trap composed of 323 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:40:03] [INFO ] Deduced a trap composed of 339 places in 291 ms of which 4 ms to minimize.
[2024-05-28 01:40:03] [INFO ] Deduced a trap composed of 305 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41554ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41570ms
[2024-05-28 01:40:26] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:40:26] [INFO ] Invariant cache hit.
[2024-05-28 01:40:27] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-28 01:40:27] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:40:27] [INFO ] Invariant cache hit.
[2024-05-28 01:40:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:40:35] [INFO ] Implicit Places using invariants and state equation in 8453 ms returned []
Implicit Place search using SMT with State Equation took 9005 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:40:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:40:35] [INFO ] Invariant cache hit.
[2024-05-28 01:40:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:40:47] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:40:47] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 162 places in 277 ms of which 4 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 396 places in 263 ms of which 4 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 394 places in 276 ms of which 4 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 3 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 269 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:40:52] [INFO ] Deduced a trap composed of 269 places in 306 ms of which 4 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:40:55] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 7 ms to minimize.
[2024-05-28 01:40:55] [INFO ] Deduced a trap composed of 294 places in 307 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:41:28] [INFO ] Deduced a trap composed of 375 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61183ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61191ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111790 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 765 ms :[(NOT p3), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-07
Product exploration explored 100000 steps with 4520 reset in 509 ms.
Product exploration explored 100000 steps with 4628 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 11 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
RANDOM walk for 283 steps (0 resets) in 60 ms. (4 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p0 p3))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 p0 p3))), (F p3), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p3)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 442 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 571 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 471 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
[2024-05-28 01:41:40] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:41:40] [INFO ] Invariant cache hit.
[2024-05-28 01:41:41] [INFO ] [Real]Absence check using 16 positive place invariants in 29 ms returned sat
[2024-05-28 01:41:41] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 14 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p0 p3))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p2 p0 p3))), (F p3), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p3)))), (F p0), (F p1), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 5 factoid took 444 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-07 finished in 117093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (p1&&G(!p0)))))'
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 18 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:41:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:41:42] [INFO ] Invariant cache hit.
[2024-05-28 01:41:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:41:52] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:41:52] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:41:52] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:41:52] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-28 01:41:52] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:41:53] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:41:53] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 01:41:53] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-28 01:41:53] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:41:54] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:41:54] [INFO ] Deduced a trap composed of 396 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:41:54] [INFO ] Deduced a trap composed of 394 places in 221 ms of which 3 ms to minimize.
[2024-05-28 01:41:55] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-28 01:41:55] [INFO ] Deduced a trap composed of 326 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:41:56] [INFO ] Deduced a trap composed of 269 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:41:57] [INFO ] Deduced a trap composed of 269 places in 219 ms of which 4 ms to minimize.
[2024-05-28 01:41:58] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-28 01:41:59] [INFO ] Deduced a trap composed of 302 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:41:59] [INFO ] Deduced a trap composed of 294 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 19/19 constraints]
After SMT, in 41611ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41627ms
[2024-05-28 01:42:23] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:42:23] [INFO ] Invariant cache hit.
[2024-05-28 01:42:24] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-28 01:42:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:42:24] [INFO ] Invariant cache hit.
[2024-05-28 01:42:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:42:34] [INFO ] Implicit Places using invariants and state equation in 9608 ms returned []
Implicit Place search using SMT with State Equation took 10154 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:42:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:42:34] [INFO ] Invariant cache hit.
[2024-05-28 01:42:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:42:45] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 01:42:46] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-28 01:42:46] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-28 01:42:46] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:42:47] [INFO ] Deduced a trap composed of 162 places in 306 ms of which 4 ms to minimize.
[2024-05-28 01:42:47] [INFO ] Deduced a trap composed of 396 places in 259 ms of which 4 ms to minimize.
[2024-05-28 01:42:47] [INFO ] Deduced a trap composed of 394 places in 236 ms of which 4 ms to minimize.
[2024-05-28 01:42:48] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:42:49] [INFO ] Deduced a trap composed of 326 places in 331 ms of which 5 ms to minimize.
[2024-05-28 01:42:49] [INFO ] Deduced a trap composed of 269 places in 312 ms of which 4 ms to minimize.
[2024-05-28 01:42:51] [INFO ] Deduced a trap composed of 269 places in 320 ms of which 5 ms to minimize.
[2024-05-28 01:42:53] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 4 ms to minimize.
[2024-05-28 01:42:53] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 4 ms to minimize.
[2024-05-28 01:42:54] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:43:27] [INFO ] Deduced a trap composed of 375 places in 212 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 8)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 8)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 2)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 2)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 9)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)timeout

(s331 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61342ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61360ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113173 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-08 finished in 113320 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&&X((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 18 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:43:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:43:35] [INFO ] Invariant cache hit.
[2024-05-28 01:43:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:43:46] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:43:46] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2024-05-28 01:43:46] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:43:46] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:43:46] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:43:47] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-28 01:43:47] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-28 01:43:47] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-28 01:43:47] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:43:48] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:43:48] [INFO ] Deduced a trap composed of 396 places in 310 ms of which 4 ms to minimize.
[2024-05-28 01:43:48] [INFO ] Deduced a trap composed of 394 places in 296 ms of which 4 ms to minimize.
[2024-05-28 01:43:49] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:43:50] [INFO ] Deduced a trap composed of 326 places in 236 ms of which 4 ms to minimize.
[2024-05-28 01:43:50] [INFO ] Deduced a trap composed of 269 places in 294 ms of which 5 ms to minimize.
[2024-05-28 01:43:51] [INFO ] Deduced a trap composed of 269 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:43:53] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:43:53] [INFO ] Deduced a trap composed of 302 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:43:53] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 4 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 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 6.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.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 4.0)
(s242 (/ 1.0 3.0))
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 10.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.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 10.0)
(s301 0.0)
(s302 0.0)
(s303 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 19/19 constraints]
After SMT, in 41419ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41437ms
[2024-05-28 01:44:17] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:44:17] [INFO ] Invariant cache hit.
[2024-05-28 01:44:17] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-28 01:44:17] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:44:17] [INFO ] Invariant cache hit.
[2024-05-28 01:44:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:44:28] [INFO ] Implicit Places using invariants and state equation in 10602 ms returned []
Implicit Place search using SMT with State Equation took 11103 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:44:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:44:28] [INFO ] Invariant cache hit.
[2024-05-28 01:44:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:44:39] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:44:39] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-28 01:44:39] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:44:39] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-28 01:44:40] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:44:41] [INFO ] Deduced a trap composed of 162 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:44:41] [INFO ] Deduced a trap composed of 396 places in 310 ms of which 4 ms to minimize.
[2024-05-28 01:44:42] [INFO ] Deduced a trap composed of 394 places in 291 ms of which 4 ms to minimize.
[2024-05-28 01:44:43] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:44:43] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 4 ms to minimize.
[2024-05-28 01:44:43] [INFO ] Deduced a trap composed of 269 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:44:45] [INFO ] Deduced a trap composed of 269 places in 305 ms of which 5 ms to minimize.
[2024-05-28 01:44:47] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:44:48] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 4 ms to minimize.
[2024-05-28 01:44:48] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:45:21] [INFO ] Deduced a trap composed of 375 places in 209 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61314ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61331ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113899 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-09
Stuttering criterion allowed to conclude after 1459 steps with 0 reset in 12 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-09 finished in 114115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 588 transition count 1042
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 532 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 352 place count 412 transition count 922
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 358 place count 406 transition count 916
Iterating global reduction 2 with 6 rules applied. Total rules applied 364 place count 406 transition count 916
Applied a total of 364 rules in 130 ms. Remains 406 /590 variables (removed 184) and now considering 916/1098 (removed 182) transitions.
Running 914 sub problems to find dead transitions.
[2024-05-28 01:45:29] [INFO ] Flow matrix only has 900 transitions (discarded 16 similar events)
// Phase 1: matrix 900 rows 406 cols
[2024-05-28 01:45:29] [INFO ] Computed 40 invariants in 34 ms
[2024-05-28 01:45:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 914 unsolved
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:45:36] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:45:37] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-05-28 01:45:38] [INFO ] Deduced a trap composed of 150 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:45:39] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:45:39] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:45:44] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:45:44] [INFO ] Deduced a trap composed of 186 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:45:46] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/1306 variables, and 56 constraints, problems are : Problem set: 0 solved, 914 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/406 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 914/914 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 914 unsolved
[2024-05-28 01:46:07] [INFO ] Deduced a trap composed of 191 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 914 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/1306 variables, and 57 constraints, problems are : Problem set: 0 solved, 914 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/406 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/914 constraints, Known Traps: 19/19 constraints]
After SMT, in 41375ms problems are : Problem set: 0 solved, 914 unsolved
Search for dead transitions found 0 dead transitions in 41389ms
[2024-05-28 01:46:11] [INFO ] Flow matrix only has 900 transitions (discarded 16 similar events)
[2024-05-28 01:46:11] [INFO ] Invariant cache hit.
[2024-05-28 01:46:11] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-28 01:46:11] [INFO ] Flow matrix only has 900 transitions (discarded 16 similar events)
[2024-05-28 01:46:11] [INFO ] Invariant cache hit.
[2024-05-28 01:46:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:46:18] [INFO ] Implicit Places using invariants and state equation in 6860 ms returned []
Implicit Place search using SMT with State Equation took 7373 ms to find 0 implicit places.
[2024-05-28 01:46:18] [INFO ] Redundant transitions in 33 ms returned []
Running 914 sub problems to find dead transitions.
[2024-05-28 01:46:18] [INFO ] Flow matrix only has 900 transitions (discarded 16 similar events)
[2024-05-28 01:46:18] [INFO ] Invariant cache hit.
[2024-05-28 01:46:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 914 unsolved
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:46:25] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:46:26] [INFO ] Deduced a trap composed of 81 places in 242 ms of which 3 ms to minimize.
[2024-05-28 01:46:26] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:46:26] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:46:26] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:46:26] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2024-05-28 01:46:27] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 3 ms to minimize.
[2024-05-28 01:46:28] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 3 ms to minimize.
[2024-05-28 01:46:28] [INFO ] Deduced a trap composed of 255 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:46:29] [INFO ] Deduced a trap composed of 242 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:46:34] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 914 unsolved
[2024-05-28 01:46:42] [INFO ] Deduced a trap composed of 203 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:46:42] [INFO ] Deduced a trap composed of 189 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:46:43] [INFO ] Deduced a trap composed of 193 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 914 unsolved
[2024-05-28 01:46:49] [INFO ] Deduced a trap composed of 160 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/1306 variables, and 59 constraints, problems are : Problem set: 0 solved, 914 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/406 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 914/914 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 914 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 914 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD552 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/406 variables, 2/61 constraints. Problems are: Problem set: 88 solved, 826 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1306 variables, and 61 constraints, problems are : Problem set: 88 solved, 826 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/406 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/914 constraints, Known Traps: 21/21 constraints]
After SMT, in 61235ms problems are : Problem set: 88 solved, 826 unsolved
Search for dead transitions found 88 dead transitions in 61251ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 406/590 places, 828/1098 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 388 transition count 796
Applied a total of 16 rules in 35 ms. Remains 388 /406 variables (removed 18) and now considering 796/828 (removed 32) transitions.
[2024-05-28 01:47:19] [INFO ] Flow matrix only has 780 transitions (discarded 16 similar events)
// Phase 1: matrix 780 rows 388 cols
[2024-05-28 01:47:19] [INFO ] Computed 40 invariants in 8 ms
[2024-05-28 01:47:20] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 01:47:20] [INFO ] Flow matrix only has 780 transitions (discarded 16 similar events)
[2024-05-28 01:47:20] [INFO ] Invariant cache hit.
[2024-05-28 01:47:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:47:24] [INFO ] Implicit Places using invariants and state equation in 3903 ms returned []
Implicit Place search using SMT with State Equation took 4248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 388/590 places, 796/1098 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114479 ms. Remains : 388/590 places, 796/1098 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-11
Stuttering criterion allowed to conclude after 7399 steps with 0 reset in 33 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-11 finished in 114581 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 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 588 transition count 1042
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 532 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 404 transition count 914
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 374 place count 398 transition count 908
Iterating global reduction 2 with 6 rules applied. Total rules applied 380 place count 398 transition count 908
Applied a total of 380 rules in 61 ms. Remains 398 /590 variables (removed 192) and now considering 908/1098 (removed 190) transitions.
Running 906 sub problems to find dead transitions.
[2024-05-28 01:47:24] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
// Phase 1: matrix 892 rows 398 cols
[2024-05-28 01:47:24] [INFO ] Computed 40 invariants in 12 ms
[2024-05-28 01:47:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:47:31] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-28 01:47:32] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-28 01:47:32] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:47:33] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:47:37] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:47:37] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 3 ms to minimize.
[2024-05-28 01:47:38] [INFO ] Deduced a trap composed of 181 places in 262 ms of which 2 ms to minimize.
[2024-05-28 01:47:38] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 2 ms to minimize.
[2024-05-28 01:47:39] [INFO ] Deduced a trap composed of 205 places in 297 ms of which 3 ms to minimize.
[2024-05-28 01:47:39] [INFO ] Deduced a trap composed of 196 places in 195 ms of which 3 ms to minimize.
[2024-05-28 01:47:40] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:47:41] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 4 ms to minimize.
[2024-05-28 01:47:41] [INFO ] Deduced a trap composed of 246 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 59 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:47:50] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 3 ms to minimize.
[2024-05-28 01:47:52] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:47:52] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:47:53] [INFO ] Deduced a trap composed of 183 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 63 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 26/26 constraints]
After SMT, in 41166ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41176ms
[2024-05-28 01:48:05] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:48:05] [INFO ] Invariant cache hit.
[2024-05-28 01:48:06] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-28 01:48:06] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:48:06] [INFO ] Invariant cache hit.
[2024-05-28 01:48:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:48:10] [INFO ] Implicit Places using invariants and state equation in 4867 ms returned []
Implicit Place search using SMT with State Equation took 5421 ms to find 0 implicit places.
[2024-05-28 01:48:10] [INFO ] Redundant transitions in 26 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-28 01:48:10] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:48:10] [INFO ] Invariant cache hit.
[2024-05-28 01:48:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:48:17] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:48:17] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:48:17] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 3 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:48:18] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 154 places in 256 ms of which 3 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:48:19] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2024-05-28 01:48:20] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2024-05-28 01:48:20] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 4 ms to minimize.
[2024-05-28 01:48:22] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:48:26] [INFO ] Deduced a trap composed of 150 places in 246 ms of which 2 ms to minimize.
[2024-05-28 01:48:27] [INFO ] Deduced a trap composed of 188 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:48:34] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 54 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:48:56] [INFO ] Deduced a trap composed of 122 places in 220 ms of which 3 ms to minimize.
[2024-05-28 01:48:57] [INFO ] Deduced a trap composed of 169 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 57 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 20/20 constraints]
After SMT, in 61246ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/590 places, 908/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107957 ms. Remains : 398/590 places, 908/1098 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-12
Product exploration explored 100000 steps with 222 reset in 581 ms.
Product exploration explored 100000 steps with 223 reset in 579 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1178 steps (0 resets) in 21 ms. (53 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 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 908/908 transitions.
Applied a total of 0 rules in 25 ms. Remains 398 /398 variables (removed 0) and now considering 908/908 (removed 0) transitions.
Running 906 sub problems to find dead transitions.
[2024-05-28 01:49:14] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:49:14] [INFO ] Invariant cache hit.
[2024-05-28 01:49:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:49:20] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-28 01:49:21] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 3 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:49:22] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-05-28 01:49:23] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:49:24] [INFO ] Deduced a trap composed of 234 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:49:29] [INFO ] Deduced a trap composed of 150 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:49:30] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 53 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:49:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:49:40] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:49:41] [INFO ] Deduced a trap composed of 183 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:49:41] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:49:41] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 2 ms to minimize.
[2024-05-28 01:49:41] [INFO ] Deduced a trap composed of 185 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:49:47] [INFO ] Deduced a trap composed of 184 places in 273 ms of which 2 ms to minimize.
[2024-05-28 01:49:53] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2024-05-28 01:49:53] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 62 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 25/25 constraints]
After SMT, in 41481ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41494ms
[2024-05-28 01:49:55] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:49:55] [INFO ] Invariant cache hit.
[2024-05-28 01:49:56] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-28 01:49:56] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:49:56] [INFO ] Invariant cache hit.
[2024-05-28 01:49:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:50:00] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 5144 ms to find 0 implicit places.
[2024-05-28 01:50:00] [INFO ] Redundant transitions in 28 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-28 01:50:00] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:50:00] [INFO ] Invariant cache hit.
[2024-05-28 01:50:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 5 ms to minimize.
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 2 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 2 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:50:09] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-28 01:50:09] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-28 01:50:10] [INFO ] Deduced a trap composed of 142 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:50:11] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:50:16] [INFO ] Deduced a trap composed of 150 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:50:17] [INFO ] Deduced a trap composed of 188 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:50:25] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 54 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:50:36] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:50:47] [INFO ] Deduced a trap composed of 122 places in 256 ms of which 2 ms to minimize.
[2024-05-28 01:50:48] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 57 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 20/20 constraints]
After SMT, in 61273ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107992 ms. Remains : 398/398 places, 908/908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3017 steps (1 resets) in 25 ms. (116 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 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 206 reset in 459 ms.
Product exploration explored 100000 steps with 216 reset in 439 ms.
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 908/908 transitions.
Applied a total of 0 rules in 14 ms. Remains 398 /398 variables (removed 0) and now considering 908/908 (removed 0) transitions.
Running 906 sub problems to find dead transitions.
[2024-05-28 01:51:03] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:51:03] [INFO ] Invariant cache hit.
[2024-05-28 01:51:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:51:09] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:51:09] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:51:09] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:51:09] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:51:09] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-28 01:51:10] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-05-28 01:51:10] [INFO ] Deduced a trap composed of 71 places in 296 ms of which 2 ms to minimize.
[2024-05-28 01:51:10] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:51:10] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 3 ms to minimize.
[2024-05-28 01:51:10] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:51:11] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2024-05-28 01:51:11] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:51:12] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:51:13] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:51:17] [INFO ] Deduced a trap composed of 150 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:51:19] [INFO ] Deduced a trap composed of 188 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 53 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:51:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-28 01:51:30] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 3 ms to minimize.
[2024-05-28 01:51:30] [INFO ] Deduced a trap composed of 183 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:51:30] [INFO ] Deduced a trap composed of 183 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:51:31] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:51:31] [INFO ] Deduced a trap composed of 185 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:51:35] [INFO ] Deduced a trap composed of 184 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:51:41] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:51:42] [INFO ] Deduced a trap composed of 169 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 62 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 25/25 constraints]
After SMT, in 41164ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41173ms
[2024-05-28 01:51:44] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:51:44] [INFO ] Invariant cache hit.
[2024-05-28 01:51:45] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-28 01:51:45] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:51:45] [INFO ] Invariant cache hit.
[2024-05-28 01:51:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:51:50] [INFO ] Implicit Places using invariants and state equation in 4943 ms returned []
Implicit Place search using SMT with State Equation took 5441 ms to find 0 implicit places.
[2024-05-28 01:51:50] [INFO ] Redundant transitions in 12 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-28 01:51:50] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 01:51:50] [INFO ] Invariant cache hit.
[2024-05-28 01:51:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:51:56] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:51:56] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:51:56] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:51:56] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-05-28 01:51:56] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 3 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-28 01:51:57] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-05-28 01:51:58] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:51:58] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 3 ms to minimize.
[2024-05-28 01:51:59] [INFO ] Deduced a trap composed of 234 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:52:03] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 2 ms to minimize.
[2024-05-28 01:52:05] [INFO ] Deduced a trap composed of 188 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:52:12] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:52:21] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 55 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:52:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-28 01:52:44] [INFO ] Deduced a trap composed of 181 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:52:46] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:52:46] [INFO ] Deduced a trap composed of 206 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:52:46] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:52:46] [INFO ] Deduced a trap composed of 196 places in 177 ms of which 2 ms to minimize.
[2024-05-28 01:52:50] [INFO ] Deduced a trap composed of 223 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 62 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 25/25 constraints]
After SMT, in 61236ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 61249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107903 ms. Remains : 398/398 places, 908/908 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-12 finished in 327278 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)&&X((G(!p0)||(!p0&&F(p1))))))'
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 1098
Applied a total of 2 rules in 8 ms. Remains 588 /590 variables (removed 2) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:52:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 01:52:51] [INFO ] Computed 40 invariants in 11 ms
[2024-05-28 01:52:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:53:02] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-28 01:53:03] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:53:03] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-05-28 01:53:03] [INFO ] Deduced a trap composed of 114 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:53:03] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 4 ms to minimize.
[2024-05-28 01:53:04] [INFO ] Deduced a trap composed of 406 places in 228 ms of which 4 ms to minimize.
[2024-05-28 01:53:04] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-28 01:53:05] [INFO ] Deduced a trap composed of 300 places in 237 ms of which 4 ms to minimize.
[2024-05-28 01:53:06] [INFO ] Deduced a trap composed of 294 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:53:07] [INFO ] Deduced a trap composed of 299 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:53:07] [INFO ] Deduced a trap composed of 269 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:53:08] [INFO ] Deduced a trap composed of 323 places in 290 ms of which 3 ms to minimize.
[2024-05-28 01:53:09] [INFO ] Deduced a trap composed of 339 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:53:09] [INFO ] Deduced a trap composed of 305 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41294ms
[2024-05-28 01:53:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:53:32] [INFO ] Invariant cache hit.
[2024-05-28 01:53:33] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 01:53:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:53:33] [INFO ] Invariant cache hit.
[2024-05-28 01:53:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:53:42] [INFO ] Implicit Places using invariants and state equation in 9385 ms returned []
Implicit Place search using SMT with State Equation took 9968 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:53:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 01:53:42] [INFO ] Invariant cache hit.
[2024-05-28 01:53:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:53:53] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-28 01:53:53] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 01:53:53] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:53:53] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:53:53] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:53:54] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:53:54] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:53:54] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:53:54] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:53:54] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:53:55] [INFO ] Deduced a trap composed of 396 places in 251 ms of which 3 ms to minimize.
[2024-05-28 01:53:55] [INFO ] Deduced a trap composed of 394 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:53:56] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:53:56] [INFO ] Deduced a trap composed of 326 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:53:56] [INFO ] Deduced a trap composed of 269 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:53:58] [INFO ] Deduced a trap composed of 269 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:54:00] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 4 ms to minimize.
[2024-05-28 01:54:01] [INFO ] Deduced a trap composed of 302 places in 252 ms of which 4 ms to minimize.
[2024-05-28 01:54:01] [INFO ] Deduced a trap composed of 294 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:54:35] [INFO ] Deduced a trap composed of 375 places in 209 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61398ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61408ms
Starting structural reductions in LTL mode, iteration 1 : 588/590 places, 1098/1098 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112683 ms. Remains : 588/590 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), p0, true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-13
Product exploration explored 100000 steps with 2349 reset in 402 ms.
Stack based approach found an accepted trace after 36946 steps with 903 reset with depth 292 and stack size 292 in 191 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-13 finished in 113584 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(F(p0))||G((p0 U X(p1))))))'
Support contains 3 out of 590 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 588 transition count 1043
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 533 transition count 1042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 532 transition count 1042
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 112 place count 532 transition count 979
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 238 place count 469 transition count 979
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 364 place count 406 transition count 916
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 369 place count 401 transition count 911
Iterating global reduction 3 with 5 rules applied. Total rules applied 374 place count 401 transition count 911
Applied a total of 374 rules in 60 ms. Remains 401 /590 variables (removed 189) and now considering 911/1098 (removed 187) transitions.
Running 909 sub problems to find dead transitions.
[2024-05-28 01:54:45] [INFO ] Flow matrix only has 895 transitions (discarded 16 similar events)
// Phase 1: matrix 895 rows 401 cols
[2024-05-28 01:54:45] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 01:54:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:54:52] [INFO ] Deduced a trap composed of 235 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:54:53] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:54:53] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:54:53] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:54:53] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:54:54] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:54:54] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 4 ms to minimize.
[2024-05-28 01:54:59] [INFO ] Deduced a trap composed of 182 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/1296 variables, and 57 constraints, problems are : Problem set: 0 solved, 909 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/401 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-05-28 01:55:12] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:55:12] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/1296 variables, and 59 constraints, problems are : Problem set: 0 solved, 909 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/401 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 21/21 constraints]
After SMT, in 41299ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 41307ms
[2024-05-28 01:55:26] [INFO ] Flow matrix only has 895 transitions (discarded 16 similar events)
[2024-05-28 01:55:26] [INFO ] Invariant cache hit.
[2024-05-28 01:55:26] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-28 01:55:26] [INFO ] Flow matrix only has 895 transitions (discarded 16 similar events)
[2024-05-28 01:55:26] [INFO ] Invariant cache hit.
[2024-05-28 01:55:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:55:31] [INFO ] Implicit Places using invariants and state equation in 4791 ms returned []
Implicit Place search using SMT with State Equation took 5184 ms to find 0 implicit places.
[2024-05-28 01:55:31] [INFO ] Redundant transitions in 30 ms returned []
Running 909 sub problems to find dead transitions.
[2024-05-28 01:55:31] [INFO ] Flow matrix only has 895 transitions (discarded 16 similar events)
[2024-05-28 01:55:31] [INFO ] Invariant cache hit.
[2024-05-28 01:55:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 90 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:55:39] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:55:40] [INFO ] Deduced a trap composed of 143 places in 181 ms of which 3 ms to minimize.
[2024-05-28 01:55:41] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:55:42] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:55:42] [INFO ] Deduced a trap composed of 235 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:55:46] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:55:46] [INFO ] Deduced a trap composed of 140 places in 227 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-05-28 01:55:55] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:55:55] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/1296 variables, and 58 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/401 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD535 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/401 variables, 2/60 constraints. Problems are: Problem set: 88 solved, 821 unsolved
[2024-05-28 01:56:27] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 4 ms to minimize.
[2024-05-28 01:56:28] [INFO ] Deduced a trap composed of 146 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:56:29] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1296 variables, and 63 constraints, problems are : Problem set: 88 solved, 821 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/401 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 23/23 constraints]
After SMT, in 61358ms problems are : Problem set: 88 solved, 821 unsolved
Search for dead transitions found 88 dead transitions in 61370ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 401/590 places, 823/1098 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 383 transition count 791
Applied a total of 16 rules in 17 ms. Remains 383 /401 variables (removed 18) and now considering 791/823 (removed 32) transitions.
[2024-05-28 01:56:33] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
// Phase 1: matrix 775 rows 383 cols
[2024-05-28 01:56:33] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 01:56:33] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-28 01:56:33] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:56:33] [INFO ] Invariant cache hit.
[2024-05-28 01:56:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:56:36] [INFO ] Implicit Places using invariants and state equation in 3063 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 383/590 places, 791/1098 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111467 ms. Remains : 383/590 places, 791/1098 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-14
Product exploration explored 100000 steps with 199 reset in 523 ms.
Product exploration explored 100000 steps with 176 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 26147 steps (12 resets) in 254 ms. (102 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 791/791 transitions.
Applied a total of 0 rules in 16 ms. Remains 383 /383 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Running 789 sub problems to find dead transitions.
[2024-05-28 01:56:38] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:56:38] [INFO ] Invariant cache hit.
[2024-05-28 01:56:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:56:43] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-28 01:56:43] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 188 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:56:44] [INFO ] Deduced a trap composed of 130 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:56:45] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-05-28 01:56:45] [INFO ] Deduced a trap composed of 147 places in 199 ms of which 2 ms to minimize.
[2024-05-28 01:56:45] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:56:45] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:56:45] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:56:46] [INFO ] Deduced a trap composed of 141 places in 227 ms of which 3 ms to minimize.
[2024-05-28 01:56:46] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:56:46] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 3 ms to minimize.
[2024-05-28 01:56:46] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 3 ms to minimize.
[2024-05-28 01:56:47] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:56:47] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:56:48] [INFO ] Deduced a trap composed of 147 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:56:48] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:56:48] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:56:48] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 3 ms to minimize.
[2024-05-28 01:56:49] [INFO ] Deduced a trap composed of 223 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:56:49] [INFO ] Deduced a trap composed of 226 places in 173 ms of which 2 ms to minimize.
[2024-05-28 01:56:49] [INFO ] Deduced a trap composed of 154 places in 256 ms of which 4 ms to minimize.
[2024-05-28 01:56:49] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:56:50] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 01:56:50] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 2 ms to minimize.
[2024-05-28 01:56:50] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 3 ms to minimize.
[2024-05-28 01:56:50] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:56:50] [INFO ] Deduced a trap composed of 188 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 172 places in 153 ms of which 2 ms to minimize.
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 243 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:56:52] [INFO ] Deduced a trap composed of 234 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:56:52] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:56:58] [INFO ] Deduced a trap composed of 153 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:56:58] [INFO ] Deduced a trap composed of 147 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:56:58] [INFO ] Deduced a trap composed of 129 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:56:58] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 2 ms to minimize.
[2024-05-28 01:56:59] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:56:59] [INFO ] Deduced a trap composed of 206 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:56:59] [INFO ] Deduced a trap composed of 200 places in 147 ms of which 2 ms to minimize.
SMT process timed out in 21029ms, After SMT, problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 21040ms
[2024-05-28 01:56:59] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:56:59] [INFO ] Invariant cache hit.
[2024-05-28 01:57:00] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-28 01:57:00] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:57:00] [INFO ] Invariant cache hit.
[2024-05-28 01:57:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:57:03] [INFO ] Implicit Places using invariants and state equation in 3026 ms returned []
Implicit Place search using SMT with State Equation took 3436 ms to find 0 implicit places.
[2024-05-28 01:57:03] [INFO ] Redundant transitions in 9 ms returned []
Running 789 sub problems to find dead transitions.
[2024-05-28 01:57:03] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:57:03] [INFO ] Invariant cache hit.
[2024-05-28 01:57:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:57:08] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 188 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 3 ms to minimize.
[2024-05-28 01:57:09] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 2 ms to minimize.
[2024-05-28 01:57:11] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:57:11] [INFO ] Deduced a trap composed of 195 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 223 places in 170 ms of which 2 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 226 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 3 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 194 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 2 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 188 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:57:14] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:57:15] [INFO ] Deduced a trap composed of 172 places in 155 ms of which 3 ms to minimize.
[2024-05-28 01:57:15] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:57:15] [INFO ] Deduced a trap composed of 243 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:57:15] [INFO ] Deduced a trap composed of 234 places in 185 ms of which 2 ms to minimize.
[2024-05-28 01:57:15] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:21] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 3 ms to minimize.
[2024-05-28 01:57:22] [INFO ] Deduced a trap composed of 153 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:57:22] [INFO ] Deduced a trap composed of 147 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:57:22] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:57:23] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 3 ms to minimize.
[2024-05-28 01:57:23] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:57:23] [INFO ] Deduced a trap composed of 206 places in 181 ms of which 2 ms to minimize.
[2024-05-28 01:57:23] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:57:24] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-05-28 01:57:24] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 3 ms to minimize.
[2024-05-28 01:57:25] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:57:25] [INFO ] Deduced a trap composed of 154 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:57:25] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 3 ms to minimize.
[2024-05-28 01:57:25] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 2 ms to minimize.
[2024-05-28 01:57:26] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:57:26] [INFO ] Deduced a trap composed of 200 places in 195 ms of which 2 ms to minimize.
[2024-05-28 01:57:26] [INFO ] Deduced a trap composed of 192 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:57:27] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:57:28] [INFO ] Deduced a trap composed of 155 places in 208 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:30] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:57:31] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:57:31] [INFO ] Deduced a trap composed of 199 places in 209 ms of which 3 ms to minimize.
[2024-05-28 01:57:31] [INFO ] Deduced a trap composed of 196 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:57:31] [INFO ] Deduced a trap composed of 198 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:57:31] [INFO ] Deduced a trap composed of 197 places in 156 ms of which 3 ms to minimize.
[2024-05-28 01:57:32] [INFO ] Deduced a trap composed of 185 places in 134 ms of which 3 ms to minimize.
[2024-05-28 01:57:32] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 2 ms to minimize.
[2024-05-28 01:57:32] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:57:33] [INFO ] Deduced a trap composed of 186 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:57:33] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:57:33] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 3 ms to minimize.
[2024-05-28 01:57:33] [INFO ] Deduced a trap composed of 150 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1158 variables, and 110 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 72/110 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:40] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:57:40] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:57:40] [INFO ] Deduced a trap composed of 183 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:57:40] [INFO ] Deduced a trap composed of 188 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 185 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 188 places in 166 ms of which 3 ms to minimize.
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 200 places in 221 ms of which 3 ms to minimize.
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-05-28 01:57:48] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 2 ms to minimize.
[2024-05-28 01:57:49] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:57:50] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:57:55] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 2 ms to minimize.
[2024-05-28 01:57:55] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:57:55] [INFO ] Deduced a trap composed of 185 places in 181 ms of which 2 ms to minimize.
[2024-05-28 01:57:55] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:57:55] [INFO ] Deduced a trap composed of 184 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 200 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 187 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 184 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 197 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 198 places in 165 ms of which 3 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 200 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 193 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 197 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 197 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 198 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:58:03] [INFO ] Deduced a trap composed of 188 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:58:03] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 2 ms to minimize.
[2024-05-28 01:58:03] [INFO ] Deduced a trap composed of 198 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:58:03] [INFO ] Deduced a trap composed of 206 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:03] [INFO ] Deduced a trap composed of 183 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1158 variables, and 141 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 103/103 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85610 ms. Remains : 383/383 places, 791/791 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 29493 steps (18 resets) in 160 ms. (183 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 176 reset in 344 ms.
Product exploration explored 100000 steps with 170 reset in 351 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 791/791 transitions.
Applied a total of 0 rules in 11 ms. Remains 383 /383 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Running 789 sub problems to find dead transitions.
[2024-05-28 01:58:05] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:58:05] [INFO ] Invariant cache hit.
[2024-05-28 01:58:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:10] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:58:10] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:58:10] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:58:10] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:58:10] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:58:11] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-28 01:58:11] [INFO ] Deduced a trap composed of 188 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:58:11] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
[2024-05-28 01:58:11] [INFO ] Deduced a trap composed of 130 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:58:11] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 147 places in 242 ms of which 3 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 2 ms to minimize.
[2024-05-28 01:58:12] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 3 ms to minimize.
[2024-05-28 01:58:13] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:58:13] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 3 ms to minimize.
[2024-05-28 01:58:13] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:58:13] [INFO ] Deduced a trap composed of 195 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:14] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:58:14] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:58:14] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 2 ms to minimize.
[2024-05-28 01:58:14] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 223 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 226 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 154 places in 146 ms of which 3 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 3 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 3 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 188 places in 174 ms of which 3 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 169 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 2 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 243 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 234 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:58:17] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:23] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:58:23] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:58:23] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:58:23] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:58:24] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:58:24] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:58:24] [INFO ] Deduced a trap composed of 206 places in 140 ms of which 2 ms to minimize.
[2024-05-28 01:58:24] [INFO ] Deduced a trap composed of 200 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:58:25] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:58:25] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:58:25] [INFO ] Deduced a trap composed of 157 places in 124 ms of which 2 ms to minimize.
[2024-05-28 01:58:25] [INFO ] Deduced a trap composed of 154 places in 145 ms of which 2 ms to minimize.
[2024-05-28 01:58:26] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:58:26] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:58:26] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 2 ms to minimize.
[2024-05-28 01:58:26] [INFO ] Deduced a trap composed of 200 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 20954ms, After SMT, problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 20961ms
[2024-05-28 01:58:26] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:58:26] [INFO ] Invariant cache hit.
[2024-05-28 01:58:27] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 01:58:27] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:58:27] [INFO ] Invariant cache hit.
[2024-05-28 01:58:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:58:29] [INFO ] Implicit Places using invariants and state equation in 2886 ms returned []
Implicit Place search using SMT with State Equation took 3243 ms to find 0 implicit places.
[2024-05-28 01:58:29] [INFO ] Redundant transitions in 9 ms returned []
Running 789 sub problems to find dead transitions.
[2024-05-28 01:58:29] [INFO ] Flow matrix only has 775 transitions (discarded 16 similar events)
[2024-05-28 01:58:30] [INFO ] Invariant cache hit.
[2024-05-28 01:58:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 188 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:58:35] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 2 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 3 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 3 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:58:36] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:58:37] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:58:37] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:58:37] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 3 ms to minimize.
[2024-05-28 01:58:37] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:58:38] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 12 ms to minimize.
[2024-05-28 01:58:38] [INFO ] Deduced a trap composed of 195 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:38] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:58:39] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:58:39] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:58:39] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:58:39] [INFO ] Deduced a trap composed of 223 places in 129 ms of which 3 ms to minimize.
[2024-05-28 01:58:39] [INFO ] Deduced a trap composed of 226 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:58:40] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:58:40] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:58:40] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:58:40] [INFO ] Deduced a trap composed of 194 places in 134 ms of which 2 ms to minimize.
[2024-05-28 01:58:40] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:58:41] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:58:41] [INFO ] Deduced a trap composed of 188 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:58:41] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:58:41] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:58:41] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:58:42] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:58:42] [INFO ] Deduced a trap composed of 243 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:58:42] [INFO ] Deduced a trap composed of 234 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:58:42] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:48] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:58:48] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:58:48] [INFO ] Deduced a trap composed of 147 places in 205 ms of which 3 ms to minimize.
[2024-05-28 01:58:49] [INFO ] Deduced a trap composed of 129 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:58:49] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-05-28 01:58:49] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 3 ms to minimize.
[2024-05-28 01:58:50] [INFO ] Deduced a trap composed of 206 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:58:50] [INFO ] Deduced a trap composed of 200 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:58:50] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:58:51] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 2 ms to minimize.
[2024-05-28 01:58:51] [INFO ] Deduced a trap composed of 157 places in 133 ms of which 2 ms to minimize.
[2024-05-28 01:58:51] [INFO ] Deduced a trap composed of 154 places in 149 ms of which 2 ms to minimize.
[2024-05-28 01:58:51] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:52] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 2 ms to minimize.
[2024-05-28 01:58:52] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:58:52] [INFO ] Deduced a trap composed of 200 places in 161 ms of which 3 ms to minimize.
[2024-05-28 01:58:52] [INFO ] Deduced a trap composed of 192 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:58:53] [INFO ] Deduced a trap composed of 224 places in 141 ms of which 2 ms to minimize.
[2024-05-28 01:58:54] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-28 01:58:56] [INFO ] Deduced a trap composed of 155 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:58:57] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 2 ms to minimize.
[2024-05-28 01:58:57] [INFO ] Deduced a trap composed of 199 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:58:57] [INFO ] Deduced a trap composed of 196 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:58:57] [INFO ] Deduced a trap composed of 198 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:58:57] [INFO ] Deduced a trap composed of 197 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:58:58] [INFO ] Deduced a trap composed of 185 places in 152 ms of which 3 ms to minimize.
[2024-05-28 01:58:58] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:58:59] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:58:59] [INFO ] Deduced a trap composed of 186 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:58:59] [INFO ] Deduced a trap composed of 182 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:58:59] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:58:59] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:59:00] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 2 ms to minimize.
[2024-05-28 01:59:00] [INFO ] Deduced a trap composed of 203 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:59:00] [INFO ] Deduced a trap composed of 199 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:59:01] [INFO ] Deduced a trap composed of 131 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 31010ms, After SMT, problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55249 ms. Remains : 383/383 places, 791/791 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-14 finished in 255964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J04T08-LTLCardinality-02
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 24 out of 590 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 590/590 places, 1098/1098 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 540 transition count 1002
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 492 transition count 1002
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 326 place count 422 transition count 932
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 422 transition count 932
Applied a total of 332 rules in 59 ms. Remains 422 /590 variables (removed 168) and now considering 932/1098 (removed 166) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 01:59:01] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-05-28 01:59:01] [INFO ] Computed 40 invariants in 10 ms
[2024-05-28 01:59:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:59:07] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:59:07] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-05-28 01:59:07] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 187 places in 207 ms of which 3 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:59:08] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-05-28 01:59:09] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 3 ms to minimize.
[2024-05-28 01:59:09] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-28 01:59:09] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2024-05-28 01:59:10] [INFO ] Deduced a trap composed of 242 places in 168 ms of which 3 ms to minimize.
[2024-05-28 01:59:10] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 222 places in 161 ms of which 3 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 3 ms to minimize.
[2024-05-28 01:59:15] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:59:16] [INFO ] Deduced a trap composed of 181 places in 322 ms of which 3 ms to minimize.
[2024-05-28 01:59:16] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:59:17] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:59:17] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 9.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 8.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 60 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:59:40] [INFO ] Deduced a trap composed of 193 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 61 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 23/23 constraints]
After SMT, in 41112ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41123ms
[2024-05-28 01:59:42] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:59:42] [INFO ] Invariant cache hit.
[2024-05-28 01:59:42] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-28 01:59:42] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:59:42] [INFO ] Invariant cache hit.
[2024-05-28 01:59:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:59:50] [INFO ] Implicit Places using invariants and state equation in 7149 ms returned []
Implicit Place search using SMT with State Equation took 7607 ms to find 0 implicit places.
Running 930 sub problems to find dead transitions.
[2024-05-28 01:59:50] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 01:59:50] [INFO ] Invariant cache hit.
[2024-05-28 01:59:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 01:59:56] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 1 ms to minimize.
[2024-05-28 01:59:56] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 4 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:59:57] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:59:58] [INFO ] Deduced a trap composed of 242 places in 161 ms of which 3 ms to minimize.
[2024-05-28 01:59:58] [INFO ] Deduced a trap composed of 156 places in 137 ms of which 1 ms to minimize.
[2024-05-28 01:59:58] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-28 01:59:59] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 3 ms to minimize.
[2024-05-28 02:00:03] [INFO ] Deduced a trap composed of 157 places in 215 ms of which 3 ms to minimize.
[2024-05-28 02:00:03] [INFO ] Deduced a trap composed of 238 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:00:04] [INFO ] Deduced a trap composed of 192 places in 240 ms of which 3 ms to minimize.
[2024-05-28 02:00:04] [INFO ] Deduced a trap composed of 195 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:00:10] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:00:12] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 3 ms to minimize.
[2024-05-28 02:00:13] [INFO ] Deduced a trap composed of 139 places in 245 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:00:19] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:00:34] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 63 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 25/25 constraints]
After SMT, in 61160ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61168ms
Starting structural reductions in LI_LTL mode, iteration 1 : 422/590 places, 932/1098 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 109963 ms. Remains : 422/590 places, 932/1098 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 7551 reset in 401 ms.
Product exploration explored 100000 steps with 7573 reset in 436 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-28 02:00:52] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:00:52] [INFO ] Invariant cache hit.
[2024-05-28 02:00:53] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:00:53] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 41 ms returned sat
[2024-05-28 02:00:54] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2024-05-28 02:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:00:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 02:00:54] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 36 ms returned sat
[2024-05-28 02:00:55] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2024-05-28 02:00:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:00:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 1332 ms returned sat
[2024-05-28 02:00:57] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 02:00:57] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:00:58] [INFO ] Deduced a trap composed of 213 places in 205 ms of which 3 ms to minimize.
[2024-05-28 02:00:58] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:00:58] [INFO ] Deduced a trap composed of 186 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:00:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1625 ms
[2024-05-28 02:00:58] [INFO ] Computed and/alt/rep : 404/1417/396 causal constraints (skipped 518 transitions) in 65 ms.
[2024-05-28 02:01:01] [INFO ] Added : 144 causal constraints over 29 iterations in 2686 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 24 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 932/932 transitions.
Applied a total of 0 rules in 14 ms. Remains 422 /422 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 02:01:01] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:01:01] [INFO ] Invariant cache hit.
[2024-05-28 02:01:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 3 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:01:08] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 242 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:01:09] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:01:10] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:01:10] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:01:15] [INFO ] Deduced a trap composed of 157 places in 167 ms of which 3 ms to minimize.
[2024-05-28 02:01:15] [INFO ] Deduced a trap composed of 238 places in 177 ms of which 3 ms to minimize.
[2024-05-28 02:01:15] [INFO ] Deduced a trap composed of 192 places in 192 ms of which 2 ms to minimize.
[2024-05-28 02:01:15] [INFO ] Deduced a trap composed of 195 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:01:22] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 59 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:01:38] [INFO ] Deduced a trap composed of 193 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:01:40] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:01:40] [INFO ] Deduced a trap composed of 194 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 24/24 constraints]
After SMT, in 41375ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41385ms
[2024-05-28 02:01:42] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:01:42] [INFO ] Invariant cache hit.
[2024-05-28 02:01:43] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-28 02:01:43] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:01:43] [INFO ] Invariant cache hit.
[2024-05-28 02:01:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:01:50] [INFO ] Implicit Places using invariants and state equation in 7020 ms returned []
Implicit Place search using SMT with State Equation took 7488 ms to find 0 implicit places.
[2024-05-28 02:01:50] [INFO ] Redundant transitions in 32 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 02:01:50] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:01:50] [INFO ] Invariant cache hit.
[2024-05-28 02:01:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:01:56] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:01:56] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 3 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:01:57] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:01:58] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:01:58] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 02:01:58] [INFO ] Deduced a trap composed of 242 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:01:58] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 2 ms to minimize.
[2024-05-28 02:01:59] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:01:59] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 3 ms to minimize.
[2024-05-28 02:02:03] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:02:04] [INFO ] Deduced a trap composed of 238 places in 177 ms of which 3 ms to minimize.
[2024-05-28 02:02:04] [INFO ] Deduced a trap composed of 192 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:02:04] [INFO ] Deduced a trap composed of 195 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:02:10] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:02:11] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:02:12] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:02:18] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:02:33] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 63 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 25/25 constraints]
After SMT, in 61324ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110268 ms. Remains : 422/422 places, 932/932 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-28 02:02:52] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:02:52] [INFO ] Invariant cache hit.
[2024-05-28 02:02:52] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-28 02:02:52] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 30 ms returned sat
[2024-05-28 02:02:53] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-28 02:02:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:02:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:02:53] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 44 ms returned sat
[2024-05-28 02:02:55] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2024-05-28 02:02:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:02:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 1092 ms returned sat
[2024-05-28 02:02:56] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:02:57] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-05-28 02:02:57] [INFO ] Deduced a trap composed of 213 places in 267 ms of which 3 ms to minimize.
[2024-05-28 02:02:57] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:02:57] [INFO ] Deduced a trap composed of 186 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:02:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1753 ms
[2024-05-28 02:02:58] [INFO ] Computed and/alt/rep : 404/1417/396 causal constraints (skipped 518 transitions) in 85 ms.
[2024-05-28 02:03:01] [INFO ] Added : 144 causal constraints over 29 iterations in 3777 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7551 reset in 482 ms.
Product exploration explored 100000 steps with 7551 reset in 531 ms.
Support contains 24 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 932/932 transitions.
Applied a total of 0 rules in 16 ms. Remains 422 /422 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 02:03:02] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:03:02] [INFO ] Invariant cache hit.
[2024-05-28 02:03:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:03:09] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-28 02:03:09] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 0 ms to minimize.
[2024-05-28 02:03:09] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-28 02:03:09] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:03:09] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 1 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:03:10] [INFO ] Deduced a trap composed of 242 places in 225 ms of which 4 ms to minimize.
[2024-05-28 02:03:11] [INFO ] Deduced a trap composed of 156 places in 121 ms of which 2 ms to minimize.
[2024-05-28 02:03:11] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-28 02:03:11] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 3 ms to minimize.
[2024-05-28 02:03:17] [INFO ] Deduced a trap composed of 157 places in 235 ms of which 3 ms to minimize.
[2024-05-28 02:03:17] [INFO ] Deduced a trap composed of 238 places in 192 ms of which 3 ms to minimize.
[2024-05-28 02:03:17] [INFO ] Deduced a trap composed of 192 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:03:17] [INFO ] Deduced a trap composed of 195 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 58 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:03:28] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:03:41] [INFO ] Deduced a trap composed of 177 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:03:42] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:03:42] [INFO ] Deduced a trap composed of 193 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 24/24 constraints]
After SMT, in 41142ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41151ms
[2024-05-28 02:03:44] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:03:44] [INFO ] Invariant cache hit.
[2024-05-28 02:03:44] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-28 02:03:44] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:03:44] [INFO ] Invariant cache hit.
[2024-05-28 02:03:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:03:51] [INFO ] Implicit Places using invariants and state equation in 7133 ms returned []
Implicit Place search using SMT with State Equation took 7606 ms to find 0 implicit places.
[2024-05-28 02:03:51] [INFO ] Redundant transitions in 12 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 02:03:51] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 02:03:51] [INFO ] Invariant cache hit.
[2024-05-28 02:03:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 0 ms to minimize.
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 2 ms to minimize.
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:03:58] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-05-28 02:03:59] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 3 ms to minimize.
[2024-05-28 02:04:00] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:04:00] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:04:01] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 3 ms to minimize.
[2024-05-28 02:04:06] [INFO ] Deduced a trap composed of 157 places in 212 ms of which 3 ms to minimize.
[2024-05-28 02:04:07] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
[2024-05-28 02:04:07] [INFO ] Deduced a trap composed of 192 places in 235 ms of which 2 ms to minimize.
[2024-05-28 02:04:07] [INFO ] Deduced a trap composed of 195 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:04:14] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:04:15] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 2 ms to minimize.
[2024-05-28 02:04:16] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 61 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 02:04:27] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 24/24 constraints]
After SMT, in 61144ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61153ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109951 ms. Remains : 422/422 places, 932/932 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLCardinality-02 finished in 351867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((p0 U X(p1))))))'
[2024-05-28 02:04:53] [INFO ] Flatten gal took : 89 ms
[2024-05-28 02:04:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 02:04:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 590 places, 1098 transitions and 4788 arcs took 8 ms.
Total runtime 2221354 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 590
TRANSITIONS: 1098
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.002s]


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


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

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

Process ID: 5256
MODEL NAME: /home/mcc/execution/420/model
590 places, 1098 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;