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.r579-smll-171734921400171.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 MedleyA-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-LTLCardinality-00
FORMULA_NAME MedleyA-PT-22-LTLCardinality-01
FORMULA_NAME MedleyA-PT-22-LTLCardinality-02
FORMULA_NAME MedleyA-PT-22-LTLCardinality-03
FORMULA_NAME MedleyA-PT-22-LTLCardinality-04
FORMULA_NAME MedleyA-PT-22-LTLCardinality-05
FORMULA_NAME MedleyA-PT-22-LTLCardinality-06
FORMULA_NAME MedleyA-PT-22-LTLCardinality-07
FORMULA_NAME MedleyA-PT-22-LTLCardinality-08
FORMULA_NAME MedleyA-PT-22-LTLCardinality-09
FORMULA_NAME MedleyA-PT-22-LTLCardinality-10
FORMULA_NAME MedleyA-PT-22-LTLCardinality-11
FORMULA_NAME MedleyA-PT-22-LTLCardinality-12
FORMULA_NAME MedleyA-PT-22-LTLCardinality-13
FORMULA_NAME MedleyA-PT-22-LTLCardinality-14
FORMULA_NAME MedleyA-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717364602253

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:43:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:43:24] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-06-02 21:43:24] [INFO ] Transformed 307 places.
[2024-06-02 21:43:24] [INFO ] Transformed 740 transitions.
[2024-06-02 21:43:24] [INFO ] Found NUPN structural information;
[2024-06-02 21:43:24] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-22-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 95 place count 212 transition count 633
Iterating global reduction 1 with 91 rules applied. Total rules applied 186 place count 212 transition count 633
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 194 place count 212 transition count 625
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 217 place count 189 transition count 569
Iterating global reduction 2 with 23 rules applied. Total rules applied 240 place count 189 transition count 569
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 181 transition count 551
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 181 transition count 551
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 261 place count 176 transition count 536
Iterating global reduction 2 with 5 rules applied. Total rules applied 266 place count 176 transition count 536
Applied a total of 266 rules in 124 ms. Remains 176 /307 variables (removed 131) and now considering 536/740 (removed 204) transitions.
// Phase 1: matrix 536 rows 176 cols
[2024-06-02 21:43:25] [INFO ] Computed 22 invariants in 32 ms
[2024-06-02 21:43:25] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-02 21:43:25] [INFO ] Invariant cache hit.
[2024-06-02 21:43:26] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-06-02 21:43:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 391 unsolved
[2024-06-02 21:43:34] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 37 ms to minimize.
[2024-06-02 21:43:35] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-06-02 21:43:35] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 2 ms to minimize.
[2024-06-02 21:43:35] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:43:36] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:43:37] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:43:37] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:43:37] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:43:37] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 14/36 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/36 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 536/712 variables, 176/212 constraints. Problems are: Problem set: 144 solved, 391 unsolved
[2024-06-02 21:43:45] [INFO ] Deduced a trap composed of 36 places in 381 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 1/213 constraints. Problems are: Problem set: 144 solved, 391 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.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 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 712/712 variables, and 213 constraints, problems are : Problem set: 144 solved, 391 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 144 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 15/37 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/37 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 536/712 variables, 176/213 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 391/604 constraints. Problems are: Problem set: 144 solved, 391 unsolved
[2024-06-02 21:44:15] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
[2024-06-02 21:44:15] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-02 21:44:16] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-06-02 21:44:17] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 4 ms to minimize.
[2024-06-02 21:44:17] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 712/712 variables, and 609 constraints, problems are : Problem set: 144 solved, 391 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 391/535 constraints, Known Traps: 20/20 constraints]
After SMT, in 62494ms problems are : Problem set: 144 solved, 391 unsolved
Search for dead transitions found 144 dead transitions in 62533ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/307 places, 392/740 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63780 ms. Remains : 176/307 places, 392/740 transitions.
Support contains 15 out of 176 places after structural reductions.
[2024-06-02 21:44:29] [INFO ] Flatten gal took : 209 ms
[2024-06-02 21:44:29] [INFO ] Flatten gal took : 66 ms
[2024-06-02 21:44:29] [INFO ] Input system was already deterministic with 392 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (1151 resets) in 2874 ms. (13 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40001 steps (275 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (244 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (240 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (234 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (236 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (240 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (244 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
// Phase 1: matrix 392 rows 176 cols
[2024-06-02 21:44:30] [INFO ] Computed 22 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 62/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 69/142 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 9/151 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 377/528 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 25/553 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/555 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/562 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/567 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/567 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 1/568 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/568 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 198 constraints, problems are : Problem set: 0 solved, 7 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 62/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 69/142 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:31] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:44:31] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:44:32] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-02 21:44:32] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 3 ms to minimize.
[2024-06-02 21:44:32] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 2 ms to minimize.
[2024-06-02 21:44:32] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 9/151 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:33] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 1 ms to minimize.
[2024-06-02 21:44:34] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 377/528 variables, 151/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 25/553 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 21:44:35] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/555 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/555 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 7/562 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/562 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 5/567 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/567 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 1/568 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/568 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/568 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 220 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 15/15 constraints]
After SMT, in 5722ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 491 ms.
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 392/392 transitions.
Graph (complete) has 748 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 175 transition count 362
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 147 transition count 362
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 147 transition count 358
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 143 transition count 358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 137 transition count 347
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 137 transition count 347
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 78 place count 137 transition count 345
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 82 place count 135 transition count 345
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 132 transition count 334
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 132 transition count 334
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 130 transition count 328
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 130 transition count 328
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 144 place count 103 transition count 303
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 99 transition count 297
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 99 transition count 297
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 94 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 183 place count 94 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 93 transition count 315
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 93 transition count 310
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 195 place count 88 transition count 310
Free-agglomeration rule (complex) applied 19 times with reduction of 8 identical transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 214 place count 88 transition count 520
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 256 place count 69 transition count 497
Applied a total of 256 rules in 185 ms. Remains 69 /176 variables (removed 107) and now considering 497/392 (removed -105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 69/176 places, 497/392 transitions.
RANDOM walk for 5360 steps (1056 resets) in 99 ms. (53 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 748 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 167 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 167 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 167 transition count 377
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 162 transition count 360
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 162 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 160 transition count 354
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 160 transition count 354
Applied a total of 33 rules in 12 ms. Remains 160 /176 variables (removed 16) and now considering 354/392 (removed 38) transitions.
// Phase 1: matrix 354 rows 160 cols
[2024-06-02 21:44:37] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:44:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 21:44:37] [INFO ] Invariant cache hit.
[2024-06-02 21:44:37] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-06-02 21:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 21:44:42] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:44:43] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:44:43] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:44:43] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:44:43] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 4 ms to minimize.
[2024-06-02 21:44:43] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 21:44:50] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 8 (OVERLAPS) 0/514 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 189 constraints, problems are : Problem set: 0 solved, 353 unsolved in 25212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 21:45:15] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-06-02 21:45:25] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 545 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 10/10 constraints]
After SMT, in 56134ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 56144ms
Starting structural reductions in LTL mode, iteration 1 : 160/176 places, 354/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56679 ms. Remains : 160/176 places, 354/392 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-01
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-01 finished in 57170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(F(p2)||p1)))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 169 transition count 382
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 165 transition count 368
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 165 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 163 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 163 transition count 362
Applied a total of 27 rules in 30 ms. Remains 163 /176 variables (removed 13) and now considering 362/392 (removed 30) transitions.
// Phase 1: matrix 362 rows 163 cols
[2024-06-02 21:45:34] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:45:34] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 21:45:34] [INFO ] Invariant cache hit.
[2024-06-02 21:45:35] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-02 21:45:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-06-02 21:45:40] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-02 21:45:41] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:45:41] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-06-02 21:45:41] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-02 21:45:41] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:45:41] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/525 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 193 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/525 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 361/554 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-06-02 21:46:17] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:46:19] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-06-02 21:46:33] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 557 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 11/11 constraints]
After SMT, in 60961ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 362/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61757 ms. Remains : 163/176 places, 362/392 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-03
Product exploration explored 100000 steps with 2913 reset in 451 ms.
Product exploration explored 100000 steps with 2907 reset in 321 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (1166 resets) in 560 ms. (71 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (276 resets) in 495 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 644 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (275 resets) in 285 ms. (139 steps per ms) remains 3/4 properties
[2024-06-02 21:46:38] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/60 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 69/129 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/138 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 347/485 variables, 138/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 25/510 variables, 16/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/512 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/519 variables, 4/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/524 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/524 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/525 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/525 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/525 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 185 constraints, problems are : Problem set: 1 solved, 2 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/60 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 69/129 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/138 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 347/485 variables, 138/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 25/510 variables, 16/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 2/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/512 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/512 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/519 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/519 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/524 variables, 2/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/524 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/525 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/525 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/525 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 188 constraints, problems are : Problem set: 1 solved, 2 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1172ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 362/362 transitions.
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 162 transition count 334
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 136 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 135 transition count 333
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 56 place count 135 transition count 327
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 129 transition count 327
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 114 place count 105 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 102 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 102 transition count 302
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 130 place count 97 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 152 place count 97 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 96 transition count 322
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 96 transition count 316
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 166 place count 90 transition count 316
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 184 place count 90 transition count 537
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 234 place count 72 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 71 transition count 504
Applied a total of 235 rules in 223 ms. Remains 71 /163 variables (removed 92) and now considering 504/362 (removed -142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 71/163 places, 504/362 transitions.
RANDOM walk for 40000 steps (6566 resets) in 951 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (960 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (933 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 516382 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 516382 steps, saw 99425 distinct states, run finished after 3005 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 504 rows 71 cols
[2024-06-02 21:46:43] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:46:43] [INFO ] State equation strengthened by 261 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/43 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 494/552 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 253/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/575 variables, 13/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/575 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/575 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/43 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 494/552 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 253/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/575 variables, 13/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/575 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:46:44] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:46:44] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/575 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 357 constraints, problems are : Problem set: 0 solved, 2 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1108ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 504/504 transitions.
Applied a total of 0 rules in 16 ms. Remains 71 /71 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 71/71 places, 504/504 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 504/504 transitions.
Applied a total of 0 rules in 18 ms. Remains 71 /71 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-06-02 21:46:44] [INFO ] Invariant cache hit.
[2024-06-02 21:46:45] [INFO ] Implicit Places using invariants in 136 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/71 places, 504/504 transitions.
Applied a total of 0 rules in 13 ms. Remains 70 /70 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 181 ms. Remains : 70/71 places, 504/504 transitions.
RANDOM walk for 40000 steps (6547 resets) in 793 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (920 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (946 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 645739 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 2
Probabilistic random walk after 645739 steps, saw 124140 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
// Phase 1: matrix 504 rows 70 cols
[2024-06-02 21:46:48] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:46:48] [INFO ] State equation strengthened by 253 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 494/551 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/574 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/574 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 343 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 494/551 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/574 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/574 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 504/504 transitions.
Applied a total of 0 rules in 14 ms. Remains 70 /70 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 70/70 places, 504/504 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 504/504 transitions.
Applied a total of 0 rules in 12 ms. Remains 70 /70 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-06-02 21:46:49] [INFO ] Invariant cache hit.
[2024-06-02 21:46:49] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 21:46:49] [INFO ] Invariant cache hit.
[2024-06-02 21:46:49] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-06-02 21:46:50] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-06-02 21:46:50] [INFO ] Redundant transitions in 33 ms returned []
Running 500 sub problems to find dead transitions.
[2024-06-02 21:46:50] [INFO ] Invariant cache hit.
[2024-06-02 21:46:50] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 21:46:57] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:46:57] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:46:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:46:57] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:46:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
Problem TDEAD423 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 5/25 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 504/574 variables, 70/95 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 253/348 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/348 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/348 constraints. Problems are: Problem set: 4 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 348 constraints, problems are : Problem set: 4 solved, 496 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 4 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 5/8 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/10 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 12/22 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 3/25 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 7 (OVERLAPS) 504/574 variables, 70/95 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 253/348 constraints. Problems are: Problem set: 4 solved, 496 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 496/844 constraints. Problems are: Problem set: 4 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 844 constraints, problems are : Problem set: 4 solved, 496 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 496/500 constraints, Known Traps: 5/5 constraints]
After SMT, in 61538ms problems are : Problem set: 4 solved, 496 unsolved
Search for dead transitions found 4 dead transitions in 61545ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/70 places, 500/504 transitions.
Applied a total of 0 rules in 14 ms. Remains 70 /70 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-02 21:47:51] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62307 ms. Remains : 70/70 places, 500/504 transitions.
RANDOM walk for 40000 steps (6514 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (935 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (942 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 634003 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 2
Probabilistic random walk after 634003 steps, saw 122157 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
// Phase 1: matrix 500 rows 70 cols
[2024-06-02 21:47:54] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:47:54] [INFO ] State equation strengthened by 253 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/547 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/570 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/570 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 343 constraints, problems are : Problem set: 0 solved, 2 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/547 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 245/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/570 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:47:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/570 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/570 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/570 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 70 /70 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 70/70 places, 500/500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 70 /70 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-02 21:47:56] [INFO ] Invariant cache hit.
[2024-06-02 21:47:56] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-02 21:47:56] [INFO ] Invariant cache hit.
[2024-06-02 21:47:56] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-06-02 21:47:57] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-06-02 21:47:57] [INFO ] Redundant transitions in 9 ms returned []
Running 496 sub problems to find dead transitions.
[2024-06-02 21:47:57] [INFO ] Invariant cache hit.
[2024-06-02 21:47:57] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-06-02 21:48:05] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 500/570 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 253/344 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 344 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 500/570 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 253/344 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 496/840 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 840 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints]
After SMT, in 61722ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 61731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62632 ms. Remains : 70/70 places, 500/500 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 558 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 362/362 transitions.
Graph (complete) has 695 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 161 transition count 335
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 136 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 135 transition count 334
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 53 place count 135 transition count 327
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 128 transition count 327
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 109 place count 106 transition count 307
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 103 transition count 304
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 103 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 97 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 149 place count 97 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 96 transition count 324
Applied a total of 151 rules in 107 ms. Remains 96 /163 variables (removed 67) and now considering 324/362 (removed 38) transitions.
// Phase 1: matrix 324 rows 96 cols
[2024-06-02 21:48:59] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:48:59] [INFO ] Implicit Places using invariants in 143 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/163 places, 324/362 transitions.
Applied a total of 0 rules in 18 ms. Remains 95 /95 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 95/163 places, 324/362 transitions.
Computed a total of 13 stabilizing places and 169 stable transitions
Computed a total of 13 stabilizing places and 169 stable transitions
Detected a total of 13/95 stabilizing places and 169/324 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 30824 steps (3615 resets) in 180 ms. (170 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11746 reset in 445 ms.
Product exploration explored 100000 steps with 11705 reset in 777 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 324/324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 93 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 93 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 92 transition count 312
Applied a total of 6 rules in 20 ms. Remains 92 /95 variables (removed 3) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 92 cols
[2024-06-02 21:49:01] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 21:49:01] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 21:49:01] [INFO ] Invariant cache hit.
[2024-06-02 21:49:01] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 21:49:02] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 21:49:02] [INFO ] Redundant transitions in 4 ms returned []
Running 306 sub problems to find dead transitions.
[2024-06-02 21:49:02] [INFO ] Invariant cache hit.
[2024-06-02 21:49:02] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/403 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 171/281 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 282 constraints, problems are : Problem set: 0 solved, 306 unsolved in 26428 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/403 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 171/281 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 306/587 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 588 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints]
After SMT, in 57080ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 57086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/95 places, 312/324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57606 ms. Remains : 92/95 places, 312/324 transitions.
Treatment of property MedleyA-PT-22-LTLCardinality-03 finished in 265002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 379
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 163 transition count 361
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 163 transition count 361
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 161 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 161 transition count 355
Applied a total of 31 rules in 13 ms. Remains 161 /176 variables (removed 15) and now considering 355/392 (removed 37) transitions.
// Phase 1: matrix 355 rows 161 cols
[2024-06-02 21:49:59] [INFO ] Computed 22 invariants in 6 ms
[2024-06-02 21:49:59] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 21:49:59] [INFO ] Invariant cache hit.
[2024-06-02 21:50:00] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2024-06-02 21:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-02 21:50:05] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 4 ms to minimize.
[2024-06-02 21:50:05] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-06-02 21:50:05] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:50:05] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:50:06] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:50:06] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:50:06] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:50:06] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-02 21:50:14] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
[2024-06-02 21:50:14] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 193 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/547 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 354 unsolved
[2024-06-02 21:50:56] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:50:57] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 3 ms to minimize.
[2024-06-02 21:50:57] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 550 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 13/13 constraints]
After SMT, in 60818ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 355/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61483 ms. Remains : 161/176 places, 355/392 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 668 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 684 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-07 finished in 62409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 165 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 165 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 163 transition count 360
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 163 transition count 360
Applied a total of 26 rules in 7 ms. Remains 163 /176 variables (removed 13) and now considering 360/392 (removed 32) transitions.
// Phase 1: matrix 360 rows 163 cols
[2024-06-02 21:51:01] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:51:02] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 21:51:02] [INFO ] Invariant cache hit.
[2024-06-02 21:51:02] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-06-02 21:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/192 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:51:17] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 193 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 359/552 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:51:45] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:51:45] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-06-02 21:51:47] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:51:59] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-06-02 21:52:00] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 557 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 13/13 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 360/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61342 ms. Remains : 163/176 places, 360/392 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 691 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLCardinality-08 finished in 61827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 380
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 379
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 164 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 164 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 163 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 163 transition count 363
Applied a total of 27 rules in 12 ms. Remains 163 /176 variables (removed 13) and now considering 363/392 (removed 29) transitions.
// Phase 1: matrix 363 rows 163 cols
[2024-06-02 21:52:03] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 21:52:03] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 21:52:03] [INFO ] Invariant cache hit.
[2024-06-02 21:52:04] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-06-02 21:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:52:10] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:52:10] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:52:10] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:52:11] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:52:11] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:52:11] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:52:11] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/526 variables, 163/192 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:52:19] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:52:27] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:52:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 195 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/526 variables, 163/195 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 362/557 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:52:48] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:52:48] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 559 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 12/12 constraints]
After SMT, in 61192ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 61199ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 363/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61848 ms. Remains : 163/176 places, 363/392 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLCardinality-10 finished in 62035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(F(p2)||p1)))))'
Found a Shortening insensitive property : MedleyA-PT-22-LTLCardinality-03
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 176/176 places, 392/392 transitions.
Graph (complete) has 748 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 363
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 147 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 146 transition count 362
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 57 place count 146 transition count 357
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 67 place count 141 transition count 357
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 136 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 136 transition count 350
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 77 place count 136 transition count 348
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 134 transition count 348
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 132 transition count 340
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 132 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 130 transition count 334
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 130 transition count 334
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 131 place count 108 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 108 transition count 313
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 137 place count 103 transition count 304
Iterating global reduction 4 with 5 rules applied. Total rules applied 142 place count 103 transition count 304
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 154 place count 97 transition count 334
Applied a total of 154 rules in 70 ms. Remains 97 /176 variables (removed 79) and now considering 334/392 (removed 58) transitions.
// Phase 1: matrix 334 rows 97 cols
[2024-06-02 21:53:06] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:53:06] [INFO ] Implicit Places using invariants in 137 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/176 places, 334/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 227 ms. Remains : 96/176 places, 334/392 transitions.
Running random walk in product with property : MedleyA-PT-22-LTLCardinality-03
Stuttering criterion allowed to conclude after 2663 steps with 273 reset in 17 ms.
Treatment of property MedleyA-PT-22-LTLCardinality-03 finished in 951 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-02 21:53:06] [INFO ] Flatten gal took : 85 ms
[2024-06-02 21:53:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 21:53:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 392 transitions and 2071 arcs took 30 ms.
Total runtime 582838 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-22-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717365190476

--------------------
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 MedleyA-PT-22-LTLCardinality-03
ltl formula formula --ltl=/tmp/1219/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 176 places, 392 transitions and 2071 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.070 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 177 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 177, there are 404 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( 1/ 4): ~48 levels ~10000 states ~35064 transitions
pnml2lts-mc( 1/ 4): ~49 levels ~20000 states ~69060 transitions
pnml2lts-mc( 2/ 4): ~46 levels ~40000 states ~172900 transitions
pnml2lts-mc( 2/ 4): ~54 levels ~80000 states ~332804 transitions
pnml2lts-mc( 2/ 4): ~59 levels ~160000 states ~650792 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~59!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 285388
pnml2lts-mc( 0/ 4): unique states count: 294077
pnml2lts-mc( 0/ 4): unique transitions count: 1314801
pnml2lts-mc( 0/ 4): - self-loop count: 640
pnml2lts-mc( 0/ 4): - claim dead count: 992304
pnml2lts-mc( 0/ 4): - claim found count: 24233
pnml2lts-mc( 0/ 4): - claim success count: 294149
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1834
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 294149 states 1315202 transitions, fanout: 4.471
pnml2lts-mc( 0/ 4): Total exploration time 2.960 sec (2.960 sec minimum, 2.960 sec on average)
pnml2lts-mc( 0/ 4): States per second: 99375, Transitions per second: 444325
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.4MB, 8.5 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 395 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.4MB (~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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r579-smll-171734921400171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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