Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118300339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118300339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717255900760

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:31:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:31:44] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2024-06-01 15:31:44] [INFO ] Transformed 309 places.
[2024-06-01 15:31:44] [INFO ] Transformed 917 transitions.
[2024-06-01 15:31:44] [INFO ] Found NUPN structural information;
[2024-06-01 15:31:44] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 675 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 231 transition count 359
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 231 transition count 359
Applied a total of 156 rules in 155 ms. Remains 231 /309 variables (removed 78) and now considering 359/917 (removed 558) transitions.
// Phase 1: matrix 359 rows 231 cols
[2024-06-01 15:31:44] [INFO ] Computed 17 invariants in 55 ms
[2024-06-01 15:31:45] [INFO ] Implicit Places using invariants in 830 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 896 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 230/309 places, 359/917 transitions.
Applied a total of 0 rules in 20 ms. Remains 230 /230 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1113 ms. Remains : 230/309 places, 359/917 transitions.
Support contains 18 out of 230 places after structural reductions.
[2024-06-01 15:31:45] [INFO ] Flatten gal took : 93 ms
[2024-06-01 15:31:45] [INFO ] Flatten gal took : 44 ms
[2024-06-01 15:31:46] [INFO ] Input system was already deterministic with 359 transitions.
Support contains 16 out of 230 places (down from 18) after GAL structural reductions.
RANDOM walk for 20433 steps (4 resets) in 1103 ms. (18 steps per ms) remains 0/8 properties
FORMULA Anderson-PT-07-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(F(p0))||G(p1)))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 227 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 227 transition count 356
Applied a total of 6 rules in 25 ms. Remains 227 /230 variables (removed 3) and now considering 356/359 (removed 3) transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-06-01 15:31:46] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 15:31:47] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 15:31:47] [INFO ] Invariant cache hit.
[2024-06-01 15:31:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:31:48] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 15:31:48] [INFO ] Invariant cache hit.
[2024-06-01 15:31:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:31:52] [INFO ] Deduced a trap composed of 104 places in 339 ms of which 55 ms to minimize.
[2024-06-01 15:31:54] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 4 ms to minimize.
[2024-06-01 15:31:54] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 4 ms to minimize.
[2024-06-01 15:31:55] [INFO ] Deduced a trap composed of 128 places in 199 ms of which 5 ms to minimize.
[2024-06-01 15:31:56] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:31:56] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 4 ms to minimize.
[2024-06-01 15:31:56] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 5 ms to minimize.
[2024-06-01 15:31:56] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 5 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 122 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:31:58] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:31:59] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 133 places in 230 ms of which 4 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 104 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 104 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:32:00] [INFO ] Deduced a trap composed of 89 places in 213 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 106 places in 208 ms of which 4 ms to minimize.
[2024-06-01 15:32:01] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:32:02] [INFO ] Deduced a trap composed of 85 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:32:02] [INFO ] Deduced a trap composed of 78 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:32:02] [INFO ] Deduced a trap composed of 131 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:32:03] [INFO ] Deduced a trap composed of 166 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:32:03] [INFO ] Deduced a trap composed of 139 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:32:03] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:32:05] [INFO ] Deduced a trap composed of 99 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:32:05] [INFO ] Deduced a trap composed of 149 places in 259 ms of which 5 ms to minimize.
[2024-06-01 15:32:05] [INFO ] Deduced a trap composed of 94 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:32:06] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:10] [INFO ] Deduced a trap composed of 96 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:32:11] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 7 ms to minimize.
[2024-06-01 15:32:12] [INFO ] Deduced a trap composed of 124 places in 270 ms of which 6 ms to minimize.
[2024-06-01 15:32:12] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 6 ms to minimize.
[2024-06-01 15:32:12] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:32:12] [INFO ] Deduced a trap composed of 109 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:32:13] [INFO ] Deduced a trap composed of 73 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:32:13] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:32:14] [INFO ] Deduced a trap composed of 137 places in 270 ms of which 6 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 124 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:32:15] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 105 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 117 places in 235 ms of which 4 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 61 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:18] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.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 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.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 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/583 variables, and 64 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 77 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:32:22] [INFO ] Deduced a trap composed of 92 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:32:23] [INFO ] Deduced a trap composed of 96 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:32:23] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:32:23] [INFO ] Deduced a trap composed of 145 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:32:24] [INFO ] Deduced a trap composed of 71 places in 260 ms of which 5 ms to minimize.
[2024-06-01 15:32:25] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 5 ms to minimize.
[2024-06-01 15:32:26] [INFO ] Deduced a trap composed of 80 places in 303 ms of which 9 ms to minimize.
[2024-06-01 15:32:27] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:32:27] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:32:27] [INFO ] Deduced a trap composed of 113 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:32:28] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:32:28] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:32:28] [INFO ] Deduced a trap composed of 89 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:32:28] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 5 ms to minimize.
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:32:29] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:31] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:32:32] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 4 ms to minimize.
[2024-06-01 15:32:32] [INFO ] Deduced a trap composed of 92 places in 285 ms of which 4 ms to minimize.
[2024-06-01 15:32:34] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:32:35] [INFO ] Deduced a trap composed of 150 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:32:35] [INFO ] Deduced a trap composed of 116 places in 190 ms of which 4 ms to minimize.
[2024-06-01 15:32:36] [INFO ] Deduced a trap composed of 103 places in 248 ms of which 5 ms to minimize.
[2024-06-01 15:32:36] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:39] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/583 variables, and 93 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/227 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/349 constraints, Known Traps: 77/77 constraints]
After SMT, in 60565ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60602ms
Starting structural reductions in LTL mode, iteration 1 : 227/230 places, 356/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62195 ms. Remains : 227/230 places, 356/359 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-03
Product exploration explored 100000 steps with 24665 reset in 533 ms.
Product exploration explored 100000 steps with 24768 reset in 323 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 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10537 steps (2 resets) in 149 ms. (70 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 510 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 356/356 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 15:32:51] [INFO ] Invariant cache hit.
[2024-06-01 15:32:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 15:32:51] [INFO ] Invariant cache hit.
[2024-06-01 15:32:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:32:53] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 15:32:53] [INFO ] Invariant cache hit.
[2024-06-01 15:32:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:32:56] [INFO ] Deduced a trap composed of 104 places in 275 ms of which 5 ms to minimize.
[2024-06-01 15:32:58] [INFO ] Deduced a trap composed of 107 places in 227 ms of which 5 ms to minimize.
[2024-06-01 15:32:58] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:32:59] [INFO ] Deduced a trap composed of 128 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:33:00] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 98 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:33:01] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:33:02] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 4 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 133 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 104 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 104 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 89 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 99 places in 275 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 106 places in 245 ms of which 4 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 4 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 78 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 131 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 88 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:08] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:33:08] [INFO ] Deduced a trap composed of 149 places in 252 ms of which 5 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 94 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 96 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:14] [INFO ] Deduced a trap composed of 128 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:33:14] [INFO ] Deduced a trap composed of 124 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 109 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:33:16] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:33:16] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 137 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 92 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 124 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 95 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 105 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 117 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 61 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:33:20] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:33:21] [INFO ] Deduced a trap composed of 126 places in 278 ms of which 4 ms to minimize.
[2024-06-01 15:33:22] [INFO ] Deduced a trap composed of 119 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:33:23] [INFO ] Deduced a trap composed of 108 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:33:23] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:33:23] [INFO ] Deduced a trap composed of 90 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 30392ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30406ms
Finished structural reductions in LTL mode , in 1 iterations and 31909 ms. Remains : 227/227 places, 356/356 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6593 steps (0 resets) in 31 ms. (206 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24842 reset in 264 ms.
Product exploration explored 100000 steps with 24532 reset in 324 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 356/356 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 227 transition count 356
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 47 place count 227 transition count 356
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 88 place count 227 transition count 356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 227 transition count 356
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 89 rules in 92 ms. Remains 227 /227 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-01 15:33:26] [INFO ] Redundant transitions in 35 ms returned []
Running 349 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-06-01 15:33:26] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 15:33:26] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:33:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:33:30] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:33:30] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 5 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 4 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 4 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 20/36 constraints. Problems are: Problem set: 89 solved, 260 unsolved
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:33:36] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 5 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:33:37] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 8 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 4 ms to minimize.
[2024-06-01 15:33:38] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 5 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:33:39] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/56 constraints. Problems are: Problem set: 89 solved, 260 unsolved
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 6 ms to minimize.
[2024-06-01 15:33:43] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:33:44] [INFO ] Deduced a trap composed of 60 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:33:44] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:33:44] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:33:45] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:33:45] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:46] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 5 ms to minimize.
[2024-06-01 15:33:46] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:46] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:33:47] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:33:47] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:33:47] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 4 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 5 ms to minimize.
[2024-06-01 15:33:48] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 17/73 constraints. Problems are: Problem set: 89 solved, 260 unsolved
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 5 ms to minimize.
[2024-06-01 15:33:51] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:33:53] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:33:54] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:33:54] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:33:54] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 4 ms to minimize.
[2024-06-01 15:33:55] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:33:55] [INFO ] Deduced a trap composed of 45 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:33:55] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:33:56] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 89 solved, 260 unsolved
Search for dead transitions found 89 dead transitions in 30334ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 227/227 places, 267/356 transitions.
Graph (complete) has 708 edges and 227 vertex of which 138 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.5 ms
Discarding 89 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 138 /227 variables (removed 89) and now considering 267/267 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 138/227 places, 267/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30499 ms. Remains : 138/227 places, 267/356 transitions.
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 356/356 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-06-01 15:33:56] [INFO ] Computed 16 invariants in 6 ms
[2024-06-01 15:33:56] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 15:33:56] [INFO ] Invariant cache hit.
[2024-06-01 15:33:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:33:58] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 15:33:58] [INFO ] Invariant cache hit.
[2024-06-01 15:33:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:02] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:34:03] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:34:03] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 4 ms to minimize.
[2024-06-01 15:34:04] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:34:04] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:34:05] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:34:05] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:34:05] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:34:05] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:34:06] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 4 ms to minimize.
[2024-06-01 15:34:06] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:07] [INFO ] Deduced a trap composed of 88 places in 225 ms of which 4 ms to minimize.
[2024-06-01 15:34:08] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 5 ms to minimize.
[2024-06-01 15:34:08] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:34:09] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:34:09] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:34:09] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:34:09] [INFO ] Deduced a trap composed of 99 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 87 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:34:10] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:34:11] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:34:12] [INFO ] Deduced a trap composed of 99 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:34:13] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:17] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:34:18] [INFO ] Deduced a trap composed of 128 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 124 places in 227 ms of which 4 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 4 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 4 ms to minimize.
[2024-06-01 15:34:20] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:34:21] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:34:21] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 124 places in 220 ms of which 4 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 95 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 105 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:34:22] [INFO ] Deduced a trap composed of 117 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:34:23] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:34:23] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 15:34:24] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 5 ms to minimize.
[2024-06-01 15:34:25] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:34:25] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:34:25] [INFO ] Deduced a trap composed of 111 places in 209 ms of which 4 ms to minimize.
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 101 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 112 places in 209 ms of which 4 ms to minimize.
[2024-06-01 15:34:26] [INFO ] Deduced a trap composed of 130 places in 212 ms of which 4 ms to minimize.
[2024-06-01 15:34:27] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:34:27] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 4 ms to minimize.
[2024-06-01 15:34:27] [INFO ] Deduced a trap composed of 77 places in 219 ms of which 6 ms to minimize.
[2024-06-01 15:34:28] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:34:28] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:34:28] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 3 ms to minimize.
SMT process timed out in 30266ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30273ms
Finished structural reductions in LTL mode , in 1 iterations and 32022 ms. Remains : 227/227 places, 356/356 transitions.
Treatment of property Anderson-PT-07-LTLCardinality-03 finished in 161953 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 230 transition count 312
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 183 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 182 transition count 311
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 96 place count 182 transition count 269
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 180 place count 140 transition count 269
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 134 transition count 239
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 134 transition count 239
Applied a total of 192 rules in 53 ms. Remains 134 /230 variables (removed 96) and now considering 239/359 (removed 120) transitions.
// Phase 1: matrix 239 rows 134 cols
[2024-06-01 15:34:28] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 15:34:28] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 15:34:28] [INFO ] Invariant cache hit.
[2024-06-01 15:34:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:34:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-06-01 15:34:29] [INFO ] Redundant transitions in 5 ms returned []
Running 232 sub problems to find dead transitions.
[2024-06-01 15:34:29] [INFO ] Invariant cache hit.
[2024-06-01 15:34:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:34:34] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:34:35] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:34:36] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:34:50] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 239/373 variables, 134/201 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 42/243 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 243 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/134 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/373 variables, and 67 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/232 constraints, Known Traps: 51/51 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/230 places, 239/359 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61013 ms. Remains : 134/230 places, 239/359 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-07
Product exploration explored 100000 steps with 165 reset in 241 ms.
Product exploration explored 100000 steps with 152 reset in 454 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 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1959 steps (0 resets) in 8 ms. (217 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 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 15:35:30] [INFO ] Invariant cache hit.
[2024-06-01 15:35:31] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 15:35:31] [INFO ] Invariant cache hit.
[2024-06-01 15:35:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:35:31] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-06-01 15:35:31] [INFO ] Redundant transitions in 2 ms returned []
Running 232 sub problems to find dead transitions.
[2024-06-01 15:35:31] [INFO ] Invariant cache hit.
[2024-06-01 15:35:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:35:36] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:35:36] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:35:36] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:35:36] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:35:37] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:35:38] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:35:38] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:35:38] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:35:38] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:35:38] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:35:39] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:35:40] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:35:41] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:35:41] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:35:41] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:35:41] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:35:41] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:35:42] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:35:43] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:35:44] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:35:47] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:35:47] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:35:47] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:35:48] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:35:49] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:35:51] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 239/373 variables, 134/201 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 42/243 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 243 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/134 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/373 variables, and 67 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/232 constraints, Known Traps: 51/51 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60781 ms. Remains : 134/134 places, 239/239 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 127 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1289 steps (0 resets) in 7 ms. (161 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 131 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 156 reset in 243 ms.
Product exploration explored 100000 steps with 124 reset in 277 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 239/239 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 15:36:32] [INFO ] Invariant cache hit.
[2024-06-01 15:36:33] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 15:36:33] [INFO ] Invariant cache hit.
[2024-06-01 15:36:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:36:33] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2024-06-01 15:36:33] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-06-01 15:36:33] [INFO ] Invariant cache hit.
[2024-06-01 15:36:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:36:39] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:36:40] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 5 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:36:42] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:36:43] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 7 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:36:45] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:36:51] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:36:53] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 239/373 variables, 134/201 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 42/243 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 243 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/134 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/373 variables, and 67 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/232 constraints, Known Traps: 51/51 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61202 ms. Remains : 134/134 places, 239/239 transitions.
Treatment of property Anderson-PT-07-LTLCardinality-07 finished in 185584 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)&&F(G(p1)))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 230 transition count 310
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 181 transition count 310
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 98 place count 181 transition count 271
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 176 place count 142 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 138 transition count 243
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 138 transition count 243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 136 transition count 241
Applied a total of 188 rules in 22 ms. Remains 136 /230 variables (removed 94) and now considering 241/359 (removed 118) transitions.
// Phase 1: matrix 241 rows 136 cols
[2024-06-01 15:37:34] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:37:34] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 15:37:34] [INFO ] Invariant cache hit.
[2024-06-01 15:37:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:37:34] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-06-01 15:37:34] [INFO ] Redundant transitions in 0 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-01 15:37:34] [INFO ] Invariant cache hit.
[2024-06-01 15:37:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:37:37] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-06-01 15:37:37] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:37:37] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:37:37] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:37:38] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:37:39] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:37:40] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:37:40] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:37:40] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:37:41] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-06-01 15:37:41] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:37:41] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:37:42] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:37:44] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:37:44] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:37:44] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:37:44] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:37:45] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 241/377 variables, 136/186 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 42/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (OVERLAPS) 0/377 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 228 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:06] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:38:06] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:38:06] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:38:07] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:38:08] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:38:09] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:11] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:38:11] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:38:12] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:38:12] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:38:12] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:38:13] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:17] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:38:17] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:38:26] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:38:26] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/377 variables, and 83 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/234 constraints, Known Traps: 68/69 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/230 places, 241/359 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60884 ms. Remains : 136/230 places, 241/359 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-08
Product exploration explored 100000 steps with 134 reset in 146 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA Anderson-PT-07-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLCardinality-08 finished in 61224 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 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 230 transition count 310
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 181 transition count 310
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 98 place count 181 transition count 271
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 176 place count 142 transition count 271
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 182 place count 136 transition count 241
Iterating global reduction 2 with 6 rules applied. Total rules applied 188 place count 136 transition count 241
Applied a total of 188 rules in 20 ms. Remains 136 /230 variables (removed 94) and now considering 241/359 (removed 118) transitions.
// Phase 1: matrix 241 rows 136 cols
[2024-06-01 15:38:35] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:38:35] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 15:38:35] [INFO ] Invariant cache hit.
[2024-06-01 15:38:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:38:36] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-06-01 15:38:36] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-06-01 15:38:36] [INFO ] Invariant cache hit.
[2024-06-01 15:38:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:38] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:38:38] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:38:38] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:38:39] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:38:40] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:38:41] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:38:41] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:38:41] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:38:41] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:38:41] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:42] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:38:42] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:38:42] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 3 ms to minimize.
[2024-06-01 15:38:42] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 7 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:38:43] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:38:44] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:49] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:38:50] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-06-01 15:38:52] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:38:53] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:38:55] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:38:56] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:38:56] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 241/377 variables, 136/215 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 42/257 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/377 variables, and 257 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 15:39:08] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:39:08] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:39:08] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:39:10] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:39:11] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:39:11] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:39:11] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:39:11] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/377 variables, and 96 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/234 constraints, Known Traps: 81/83 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/230 places, 241/359 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61047 ms. Remains : 136/230 places, 241/359 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 608 steps with 0 reset with depth 609 and stack size 417 in 2 ms.
FORMULA Anderson-PT-07-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLCardinality-10 finished in 61290 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 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 230 transition count 311
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 182 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 181 transition count 310
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 98 place count 181 transition count 268
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 182 place count 139 transition count 268
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 188 place count 133 transition count 238
Iterating global reduction 3 with 6 rules applied. Total rules applied 194 place count 133 transition count 238
Applied a total of 194 rules in 18 ms. Remains 133 /230 variables (removed 97) and now considering 238/359 (removed 121) transitions.
// Phase 1: matrix 238 rows 133 cols
[2024-06-01 15:39:36] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:39:37] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 15:39:37] [INFO ] Invariant cache hit.
[2024-06-01 15:39:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:39:37] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2024-06-01 15:39:37] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2024-06-01 15:39:37] [INFO ] Invariant cache hit.
[2024-06-01 15:39:37] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:39:43] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:39:44] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:39:46] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:39:47] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:39:48] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 238/371 variables, 133/174 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 42/216 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 216 constraints, problems are : Problem set: 0 solved, 231 unsolved in 20900 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 1/133 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-01 15:40:13] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:40:14] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:40:14] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:40:16] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 6 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:40:18] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/371 variables, and 54 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/231 constraints, Known Traps: 38/38 constraints]
After SMT, in 51096ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 51101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/230 places, 238/359 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52094 ms. Remains : 133/230 places, 238/359 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA Anderson-PT-07-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLCardinality-13 finished in 52320 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))||G(p1)))'
Found a Shortening insensitive property : Anderson-PT-07-LTLCardinality-03
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 230/230 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 230 transition count 312
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 183 transition count 312
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 94 place count 183 transition count 271
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 176 place count 142 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 139 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 139 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 138 transition count 267
Applied a total of 184 rules in 26 ms. Remains 138 /230 variables (removed 92) and now considering 267/359 (removed 92) transitions.
// Phase 1: matrix 267 rows 138 cols
[2024-06-01 15:40:29] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 15:40:29] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 15:40:29] [INFO ] Invariant cache hit.
[2024-06-01 15:40:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:40:30] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-01 15:40:30] [INFO ] Invariant cache hit.
[2024-06-01 15:40:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:40:36] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:40:37] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:40:37] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:37] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:38] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:40:39] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 4 ms to minimize.
[2024-06-01 15:40:40] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:40:41] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:40:42] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:40:42] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:45] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:40:45] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:40:47] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:49] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2024-06-01 15:40:50] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:40:51] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:40:52] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:54] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:40:55] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:57] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:40:57] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:40:58] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:40:59] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:40:59] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:41:00] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:41:00] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:41:00] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:41:00] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 30347ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 30352ms
Starting structural reductions in LI_LTL mode, iteration 1 : 138/230 places, 267/359 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31356 ms. Remains : 138/230 places, 267/359 transitions.
Running random walk in product with property : Anderson-PT-07-LTLCardinality-03
Product exploration explored 100000 steps with 30859 reset in 165 ms.
Product exploration explored 100000 steps with 30605 reset in 176 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 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 352 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1434 steps (0 resets) in 14 ms. (95 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 15:41:02] [INFO ] Invariant cache hit.
[2024-06-01 15:41:02] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 15:41:02] [INFO ] Invariant cache hit.
[2024-06-01 15:41:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:41:03] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-01 15:41:03] [INFO ] Invariant cache hit.
[2024-06-01 15:41:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:05] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:41:05] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:41:05] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:41:06] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:41:07] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:41:08] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:41:08] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:41:08] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:08] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:41:09] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 3 ms to minimize.
[2024-06-01 15:41:09] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:41:09] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:41:10] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:41:11] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:13] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 3 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:41:14] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:41:15] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:41:15] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:41:15] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:41:15] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:41:15] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:16] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:41:16] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:41:16] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:41:17] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:41:17] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:41:17] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:41:17] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:41:18] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:41:18] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:41:18] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:41:18] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:41:19] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:41:20] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:41:20] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:21] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-06-01 15:41:22] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:41:25] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:41:27] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:41:28] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:41:30] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:41:31] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:41:32] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:41:32] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/405 variables, and 104 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/405 variables, and 104 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/260 constraints, Known Traps: 88/88 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in LTL mode , in 1 iterations and 61073 ms. Remains : 138/138 places, 267/267 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2551 steps (0 resets) in 54 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 531 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 30535 reset in 289 ms.
Product exploration explored 100000 steps with 30741 reset in 333 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 267/267 transitions.
Applied a total of 0 rules in 21 ms. Remains 138 /138 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 15:42:06] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-01 15:42:06] [INFO ] Invariant cache hit.
[2024-06-01 15:42:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:08] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:42:09] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:42:10] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:42:11] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:42:11] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 4 ms to minimize.
[2024-06-01 15:42:11] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:42:11] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:42:11] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:42:12] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:42:12] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:12] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:42:13] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:42:13] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:42:14] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:42:14] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:42:14] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:42:15] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:42:15] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:42:15] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:42:15] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:42:15] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:42:16] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:42:17] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:19] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:42:21] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:42:21] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:42:21] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:42:27] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:29] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:42:30] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:33] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:42:33] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:42:35] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/405 variables, and 90 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:42:38] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/405 variables, and 91 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/260 constraints, Known Traps: 75/75 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60303 ms. Remains : 138/138 places, 267/267 transitions.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 15:43:06] [INFO ] Invariant cache hit.
[2024-06-01 15:43:06] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 15:43:06] [INFO ] Invariant cache hit.
[2024-06-01 15:43:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 15:43:07] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-01 15:43:07] [INFO ] Invariant cache hit.
[2024-06-01 15:43:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:09] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:43:09] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:43:09] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:43:10] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:43:11] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:43:12] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:43:12] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:43:12] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:43:12] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:12] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:43:13] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:43:13] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:43:13] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:43:14] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:43:15] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:43:16] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:18] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:43:18] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:43:18] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 6 ms to minimize.
[2024-06-01 15:43:18] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:43:18] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:43:19] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:43:19] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:43:19] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:43:19] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:43:20] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:43:20] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:43:20] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:43:21] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:43:22] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:43:23] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:43:23] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:43:23] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:43:23] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:43:23] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:43:24] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:43:25] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:27] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:43:28] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:31] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:43:31] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:43:33] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:34] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:43:35] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:43:36] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:43:37] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:43:37] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/405 variables, and 102 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:43:39] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:43:40] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:43:42] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:43:42] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:43:42] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:43:42] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/405 variables, and 109 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/260 constraints, Known Traps: 93/93 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in LTL mode , in 1 iterations and 61048 ms. Remains : 138/138 places, 267/267 transitions.
Treatment of property Anderson-PT-07-LTLCardinality-03 finished in 218294 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)))'
[2024-06-01 15:44:07] [INFO ] Flatten gal took : 79 ms
[2024-06-01 15:44:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 15:44:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 230 places, 359 transitions and 1246 arcs took 8 ms.
Total runtime 744292 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Anderson-PT-07-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Anderson-PT-07-LTLCardinality-07

BK_STOP 1717256739961

--------------------
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
mcc2024
ltl formula name Anderson-PT-07-LTLCardinality-03
ltl formula formula --ltl=/tmp/4134/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 230 places, 359 transitions and 1246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4134/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4134/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4134/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4134/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 232 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 231, there are 379 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~18 levels ~10000 states ~24336 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~20000 states ~55876 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~40000 states ~93936 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~80000 states ~223004 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~160000 states ~478372 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~320000 states ~959648 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 379907
pnml2lts-mc( 0/ 4): unique states count: 379907
pnml2lts-mc( 0/ 4): unique transitions count: 1291772
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 912495
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 380452
pnml2lts-mc( 0/ 4): - cum. max stack depth: 72
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 380452 states 1294776 transitions, fanout: 3.403
pnml2lts-mc( 0/ 4): Total exploration time 3.530 sec (3.530 sec minimum, 3.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 107777, Transitions per second: 366792
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.0MB, 16.7 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 362 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 6.0MB (~256.0MB paged-in)
ltl formula name Anderson-PT-07-LTLCardinality-07
ltl formula formula --ltl=/tmp/4134/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 230 places, 359 transitions and 1246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4134/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4134/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4134/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4134/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 232 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 231, there are 368 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2058 levels ~10000 states ~26340 transitions
pnml2lts-mc( 3/ 4): ~4035 levels ~20000 states ~52740 transitions
pnml2lts-mc( 3/ 4): ~8036 levels ~40000 states ~108444 transitions
pnml2lts-mc( 3/ 4): ~15914 levels ~80000 states ~228400 transitions
pnml2lts-mc( 3/ 4): ~31697 levels ~160000 states ~457988 transitions
pnml2lts-mc( 0/ 4): ~58527 levels ~320000 states ~878156 transitions
pnml2lts-mc( 0/ 4): ~105411 levels ~640000 states ~1759892 transitions
pnml2lts-mc( 0/ 4): ~223512 levels ~1280000 states ~3738672 transitions
pnml2lts-mc( 0/ 4): ~439460 levels ~2560000 states ~7906964 transitions
pnml2lts-mc( 0/ 4): ~820147 levels ~5120000 states ~16915376 transitions
pnml2lts-mc( 0/ 4): ~1427492 levels ~10240000 states ~37191152 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 119300
pnml2lts-mc( 0/ 4): unique states count: 12118014
pnml2lts-mc( 0/ 4): unique transitions count: 46519199
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 258103
pnml2lts-mc( 0/ 4): - claim found count: 25058279
pnml2lts-mc( 0/ 4): - claim success count: 12118067
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6205995
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12118094 states 46519381 transitions, fanout: 3.839
pnml2lts-mc( 0/ 4): Total exploration time 87.470 sec (87.470 sec minimum, 87.470 sec on average)
pnml2lts-mc( 0/ 4): States per second: 138540, Transitions per second: 531832
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 169.7MB, 12.8 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 41.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 362 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 169.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-07, 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 r464-smll-171620118300339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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