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.r576-smll-171734920100148.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 itstools
Input is MedleyA-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-LTLFireability-00
FORMULA_NAME MedleyA-PT-19-LTLFireability-01
FORMULA_NAME MedleyA-PT-19-LTLFireability-02
FORMULA_NAME MedleyA-PT-19-LTLFireability-03
FORMULA_NAME MedleyA-PT-19-LTLFireability-04
FORMULA_NAME MedleyA-PT-19-LTLFireability-05
FORMULA_NAME MedleyA-PT-19-LTLFireability-06
FORMULA_NAME MedleyA-PT-19-LTLFireability-07
FORMULA_NAME MedleyA-PT-19-LTLFireability-08
FORMULA_NAME MedleyA-PT-19-LTLFireability-09
FORMULA_NAME MedleyA-PT-19-LTLFireability-10
FORMULA_NAME MedleyA-PT-19-LTLFireability-11
FORMULA_NAME MedleyA-PT-19-LTLFireability-12
FORMULA_NAME MedleyA-PT-19-LTLFireability-13
FORMULA_NAME MedleyA-PT-19-LTLFireability-14
FORMULA_NAME MedleyA-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717384901388

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-03 03:21:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 03:21:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 03:21:43] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-06-03 03:21:43] [INFO ] Transformed 272 places.
[2024-06-03 03:21:43] [INFO ] Transformed 586 transitions.
[2024-06-03 03:21:43] [INFO ] Found NUPN structural information;
[2024-06-03 03:21:43] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 77 place count 192 transition count 496
Iterating global reduction 1 with 75 rules applied. Total rules applied 152 place count 192 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 189 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 189 transition count 490
Applied a total of 158 rules in 133 ms. Remains 189 /269 variables (removed 80) and now considering 490/583 (removed 93) transitions.
// Phase 1: matrix 490 rows 189 cols
[2024-06-03 03:21:44] [INFO ] Computed 22 invariants in 44 ms
[2024-06-03 03:21:45] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-06-03 03:21:45] [INFO ] Invariant cache hit.
[2024-06-03 03:21:45] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-06-03 03:21:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 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 TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 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 TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-03 03:21:55] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 29 ms to minimize.
[2024-06-03 03:21:56] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-06-03 03:21:56] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 4 ms to minimize.
[2024-06-03 03:21:56] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 4 ms to minimize.
[2024-06-03 03:21:56] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:21:57] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-03 03:21:57] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:21:57] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 4 ms to minimize.
[2024-06-03 03:21:57] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:21:57] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-03 03:21:58] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-03 03:21:58] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:21:58] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 13/35 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/35 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 490/679 variables, 189/224 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-03 03:22:06] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 4 ms to minimize.
[2024-06-03 03:22:06] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-06-03 03:22:07] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-06-03 03:22:08] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-03 03:22:08] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:22:08] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:22:09] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-06-03 03:22:09] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 8/232 constraints. Problems are: Problem set: 120 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/679 variables, and 232 constraints, problems are : Problem set: 120 solved, 369 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 120 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 21/43 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/43 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 490/679 variables, 189/232 constraints. Problems are: Problem set: 120 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 369/601 constraints. Problems are: Problem set: 120 solved, 369 unsolved
[2024-06-03 03:22:33] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 1/602 constraints. Problems are: Problem set: 120 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 602 constraints, problems are : Problem set: 120 solved, 369 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 369/489 constraints, Known Traps: 22/22 constraints]
After SMT, in 62071ms problems are : Problem set: 120 solved, 369 unsolved
Search for dead transitions found 120 dead transitions in 62121ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/269 places, 370/583 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63523 ms. Remains : 189/269 places, 370/583 transitions.
Support contains 40 out of 189 places after structural reductions.
[2024-06-03 03:22:48] [INFO ] Flatten gal took : 100 ms
[2024-06-03 03:22:48] [INFO ] Flatten gal took : 44 ms
[2024-06-03 03:22:48] [INFO ] Input system was already deterministic with 370 transitions.
RANDOM walk for 40000 steps (16 resets) in 2348 ms. (17 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (12 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (11 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (13 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
// Phase 1: matrix 370 rows 189 cols
[2024-06-03 03:22:49] [INFO ] Computed 22 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 60/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 3 (OVERLAPS) 75/169 variables, 14/20 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 360/529 variables, 169/189 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 19/548 variables, 13/202 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/549 variables, 2/204 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 9/558 variables, 5/210 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/559 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 211 constraints, problems are : Problem set: 3 solved, 19 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/90 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 76/166 variables, 13/19 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-03 03:22:52] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 12/31 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-03 03:22:53] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/33 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 3/169 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 360/529 variables, 169/203 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 9/212 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-03 03:22:54] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 1/213 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/213 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 19/548 variables, 13/226 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 9/235 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-03 03:22:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-03 03:22:55] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-03 03:22:55] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 3/238 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 1/549 variables, 2/240 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 1/241 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-03 03:22:56] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 7336ms, After SMT, problems are : Problem set: 4 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 187 transition count 345
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 164 transition count 343
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 163 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 162 transition count 342
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 52 place count 162 transition count 333
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 70 place count 153 transition count 333
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 74 place count 149 transition count 326
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 149 transition count 326
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 125 place count 125 transition count 303
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 125 transition count 302
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 136 place count 120 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 158 place count 120 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 120 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 162 place count 118 transition count 307
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 7 with 2 rules applied. Total rules applied 164 place count 117 transition count 317
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 170 place count 117 transition count 311
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 176 place count 111 transition count 311
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 187 place count 111 transition count 358
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 208 place count 100 transition count 348
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 220 place count 100 transition count 348
Applied a total of 220 rules in 147 ms. Remains 100 /189 variables (removed 89) and now considering 348/370 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 100/189 places, 348/370 transitions.
RANDOM walk for 40000 steps (154 resets) in 536 ms. (74 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40002 steps (131 resets) in 593 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (102 resets) in 325 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (142 resets) in 306 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (174 resets) in 278 ms. (143 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (120 resets) in 178 ms. (223 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (79 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (100 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (70 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 78 ms. (506 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (89 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (157 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
// Phase 1: matrix 348 rows 100 cols
[2024-06-03 03:22:58] [INFO ] Computed 21 invariants in 4 ms
[2024-06-03 03:22:58] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 348/440 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 8/448 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/448 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 129 constraints, problems are : Problem set: 0 solved, 9 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 100/100 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/92 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 348/440 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 8/448 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/448 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 138 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 100/100 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2336ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 7 properties in 2434 ms.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 348/348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 345
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 97 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 97 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 96 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 94 transition count 342
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 94 transition count 342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 94 transition count 341
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 93 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 35 place count 82 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 82 transition count 330
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 82 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 44 place count 78 transition count 326
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 50 place count 78 transition count 504
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 89 place count 72 transition count 471
Applied a total of 89 rules in 122 ms. Remains 72 /100 variables (removed 28) and now considering 471/348 (removed -123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 72/100 places, 471/348 transitions.
RANDOM walk for 40000 steps (4971 resets) in 504 ms. (79 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (815 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
// Phase 1: matrix 471 rows 72 cols
[2024-06-03 03:23:03] [INFO ] Computed 20 invariants in 6 ms
[2024-06-03 03:23:03] [INFO ] State equation strengthened by 170 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/84 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 416/500 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 130/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/519 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/529 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/531 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/543 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/543 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/84 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 416/500 variables, 34/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 130/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/519 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/529 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/531 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/543 variables, 22/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/543 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 471/471 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 470
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 67 transition count 467
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 67 transition count 489
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 23 place count 66 transition count 477
Applied a total of 23 rules in 70 ms. Remains 66 /72 variables (removed 6) and now considering 477/471 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 66/72 places, 477/471 transitions.
RANDOM walk for 36878 steps (6186 resets) in 645 ms. (57 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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) U p1))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 11 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-03 03:23:04] [INFO ] Computed 22 invariants in 5 ms
[2024-06-03 03:23:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-03 03:23:04] [INFO ] Invariant cache hit.
[2024-06-03 03:23:05] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 03:23:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:23:11] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-06-03 03:23:11] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-03 03:23:11] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:23:11] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-03 03:23:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-03 03:23:13] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-03 03:23:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:23:21] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-06-03 03:23:21] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2024-06-03 03:23:21] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 4 ms to minimize.
[2024-06-03 03:23:21] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:23:22] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:23:22] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-03 03:23:22] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-06-03 03:23:23] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:24:02] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-03 03:24:02] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61131 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 313 ms.
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-00 finished in 62014 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 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 6 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 03:24:06] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 03:24:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-03 03:24:06] [INFO ] Invariant cache hit.
[2024-06-03 03:24:07] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 03:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:24:12] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 4 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:24:13] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-03 03:24:14] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-03 03:24:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-03 03:24:14] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-03 03:24:14] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:24:19] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/551 variables, 185/219 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:24:30] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 4 ms to minimize.
[2024-06-03 03:24:30] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 3 ms to minimize.
[2024-06-03 03:24:30] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 3 ms to minimize.
[2024-06-03 03:24:31] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-03 03:24:31] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-03 03:24:32] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-03 03:24:32] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 226 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/591 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:24:49] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:24:51] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 593 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 250 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-19-LTLFireability-01 finished in 61204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 186 transition count 337
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 156 transition count 331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 153 transition count 331
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 153 transition count 320
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 134 transition count 309
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 134 transition count 308
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 133 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 173 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 183 place count 95 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 203 place count 95 transition count 287
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 3 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Applied a total of 205 rules in 92 ms. Remains 94 /189 variables (removed 95) and now considering 297/370 (removed 73) transitions.
[2024-06-03 03:25:08] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
// Phase 1: matrix 296 rows 94 cols
[2024-06-03 03:25:08] [INFO ] Computed 19 invariants in 3 ms
[2024-06-03 03:25:08] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 03:25:08] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-03 03:25:08] [INFO ] Invariant cache hit.
[2024-06-03 03:25:08] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-03 03:25:08] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-06-03 03:25:08] [INFO ] Redundant transitions in 138 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 03:25:08] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-03 03:25:08] [INFO ] Invariant cache hit.
[2024-06-03 03:25:08] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 216 constraints, problems are : Problem set: 0 solved, 288 unsolved in 24624 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 288/502 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 504 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 55442ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 55448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56154 ms. Remains : 94/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-02
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-02 finished in 56231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||X(p1))))&&F(p0)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 24 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 03:26:04] [INFO ] Computed 22 invariants in 6 ms
[2024-06-03 03:26:04] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-03 03:26:04] [INFO ] Invariant cache hit.
[2024-06-03 03:26:04] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 03:26:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:26:10] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
[2024-06-03 03:26:10] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-06-03 03:26:11] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:26:11] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-03 03:26:11] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:26:11] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:26:11] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:26:12] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-03 03:26:12] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 2 ms to minimize.
[2024-06-03 03:26:12] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2024-06-03 03:26:13] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
[2024-06-03 03:26:13] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-06-03 03:26:13] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 2 ms to minimize.
[2024-06-03 03:26:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:26:13] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/222 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:26:22] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 4 ms to minimize.
[2024-06-03 03:26:22] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-03 03:26:22] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2024-06-03 03:26:23] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:26:33] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-03 03:26:33] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-03 03:26:33] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-03 03:26:34] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 230 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/230 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/595 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:26:50] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:27:02] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 597 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 25/25 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61191 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 154 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-19-LTLFireability-03 finished in 61601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
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 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 182 place count 96 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 202 place count 96 transition count 287
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 3 with 2 rules applied. Total rules applied 204 place count 95 transition count 297
Applied a total of 204 rules in 76 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-03 03:27:05] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 03:27:05] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-03 03:27:05] [INFO ] Invariant cache hit.
[2024-06-03 03:27:06] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-03 03:27:06] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-06-03 03:27:06] [INFO ] Redundant transitions in 92 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 03:27:06] [INFO ] Invariant cache hit.
[2024-06-03 03:27:06] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 21740 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 52348ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 52354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53065 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-04 finished in 53167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1)))) U (p2 U p3)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 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 28 rules applied. Total rules applied 29 place count 186 transition count 339
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 63 place count 158 transition count 333
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 155 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 154 transition count 332
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 68 place count 154 transition count 320
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 99 place count 135 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 135 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 106 place count 135 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 173 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 183 place count 95 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 203 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 94 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 93 transition count 296
Applied a total of 207 rules in 90 ms. Remains 93 /189 variables (removed 96) and now considering 296/370 (removed 74) transitions.
[2024-06-03 03:27:59] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 93 cols
[2024-06-03 03:27:59] [INFO ] Computed 19 invariants in 3 ms
[2024-06-03 03:27:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-03 03:27:59] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-03 03:27:59] [INFO ] Invariant cache hit.
[2024-06-03 03:27:59] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-03 03:27:59] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-06-03 03:27:59] [INFO ] Redundant transitions in 59 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 03:27:59] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-03 03:27:59] [INFO ] Invariant cache hit.
[2024-06-03 03:27:59] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-03 03:28:03] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-03 03:28:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 294/387 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 135/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/388 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 250 constraints, problems are : Problem set: 0 solved, 288 unsolved in 20174 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 294/387 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 135/249 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 288/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/388 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 538 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints]
After SMT, in 50627ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 50630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 296/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51301 ms. Remains : 93/189 places, 296/370 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p3), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-05 finished in 51604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U p1)))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 186 transition count 338
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 157 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 155 transition count 334
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 65 place count 155 transition count 322
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 89 place count 143 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 97 place count 135 transition count 311
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 135 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 135 transition count 310
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 107 place count 134 transition count 310
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 163 place count 105 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 173 place count 100 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 194 place count 100 transition count 291
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 100 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 99 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 98 transition count 300
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 98 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 97 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 97 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 96 transition count 298
Applied a total of 203 rules in 86 ms. Remains 96 /189 variables (removed 93) and now considering 298/370 (removed 72) transitions.
[2024-06-03 03:28:50] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
// Phase 1: matrix 297 rows 96 cols
[2024-06-03 03:28:50] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 03:28:50] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 03:28:50] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-03 03:28:50] [INFO ] Invariant cache hit.
[2024-06-03 03:28:50] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-03 03:28:50] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-03 03:28:51] [INFO ] Redundant transitions in 57 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-03 03:28:51] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-03 03:28:51] [INFO ] Invariant cache hit.
[2024-06-03 03:28:51] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 296/392 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 96/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 213 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19798 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 296/392 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 96/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 290/502 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 503 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 50397ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 50403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 298/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50922 ms. Remains : 96/189 places, 298/370 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-06 finished in 51163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
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 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 182 place count 96 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 202 place count 96 transition count 287
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 3 with 2 rules applied. Total rules applied 204 place count 95 transition count 297
Applied a total of 204 rules in 62 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-03 03:29:41] [INFO ] Computed 20 invariants in 3 ms
[2024-06-03 03:29:41] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-03 03:29:41] [INFO ] Invariant cache hit.
[2024-06-03 03:29:42] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-03 03:29:42] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-03 03:29:42] [INFO ] Redundant transitions in 83 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 03:29:42] [INFO ] Invariant cache hit.
[2024-06-03 03:29:42] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 24949 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 55604ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 55614ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56289 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 161 ms.
Product exploration explored 100000 steps with 1 reset in 185 ms.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 42 ms :[(NOT p0)]
RANDOM walk for 142 steps (10 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 95 /95 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-03 03:30:38] [INFO ] Invariant cache hit.
[2024-06-03 03:30:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-03 03:30:38] [INFO ] Invariant cache hit.
[2024-06-03 03:30:39] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-03 03:30:39] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-03 03:30:39] [INFO ] Redundant transitions in 59 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-03 03:30:39] [INFO ] Invariant cache hit.
[2024-06-03 03:30:39] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 245 constraints, problems are : Problem set: 0 solved, 288 unsolved in 24308 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 296/390 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 129/243 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 288/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 533 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 54849ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 54855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55305 ms. Remains : 95/95 places, 297/297 transitions.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 50 ms :[(NOT p0)]
RANDOM walk for 17017 steps (30 resets) in 155 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Product exploration explored 100000 steps with 1 reset in 205 ms.
Built C files in :
/tmp/ltsmin1271899454857818297
[2024-06-03 03:31:35] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-06-03 03:31:35] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:31:35] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-06-03 03:31:35] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:31:35] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-06-03 03:31:35] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:31:35] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1271899454857818297
Running compilation step : cd /tmp/ltsmin1271899454857818297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1902 ms.
Running link step : cd /tmp/ltsmin1271899454857818297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin1271899454857818297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16239925505704772914.hoa' '--buchi-type=spotba'
LTSmin run took 1067 ms.
FORMULA MedleyA-PT-19-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-07 finished in 116709 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((p0||F(p1)))&&G(p2))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 4 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-03 03:31:38] [INFO ] Computed 22 invariants in 2 ms
[2024-06-03 03:31:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 03:31:38] [INFO ] Invariant cache hit.
[2024-06-03 03:31:38] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 03:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:31:44] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-06-03 03:31:44] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-06-03 03:31:44] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-06-03 03:31:44] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-03 03:31:44] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-06-03 03:31:45] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:31:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-03 03:31:45] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-03 03:31:45] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-03 03:31:45] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-03 03:31:46] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-03 03:31:46] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:31:54] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 4 ms to minimize.
[2024-06-03 03:31:54] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 3 ms to minimize.
[2024-06-03 03:31:54] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 4 ms to minimize.
[2024-06-03 03:31:55] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:31:55] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-06-03 03:31:56] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-06-03 03:31:56] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-03 03:31:56] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:32:35] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-06-03 03:32:35] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60649ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61142 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-08
Product exploration explored 100000 steps with 4 reset in 285 ms.
Product exploration explored 100000 steps with 10 reset in 237 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
RANDOM walk for 40000 steps (11 resets) in 167 ms. (238 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
[2024-06-03 03:32:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/155 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/516 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/536 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/537 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/548 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/548 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/549 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/549 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/155 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/164 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/516 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:32:41] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/536 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/537 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/548 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/549 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:32:42] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-03 03:32:42] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1320ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 365/365 transitions.
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 182 transition count 331
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 151 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 148 transition count 325
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 73 place count 148 transition count 314
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 95 place count 137 transition count 314
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 134 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 134 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 163 place count 102 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 102 transition count 277
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 174 place count 97 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 194 place count 97 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 96 transition count 296
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 96 transition count 290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 208 place count 90 transition count 290
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 226 place count 90 transition count 494
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 298 place count 72 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 72 transition count 440
Applied a total of 300 rules in 96 ms. Remains 72 /184 variables (removed 112) and now considering 440/365 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 72/184 places, 440/365 transitions.
RANDOM walk for 40000 steps (11 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (22 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 444364 steps, run visited all 1 properties in 1609 ms. (steps per millisecond=276 )
Probabilistic random walk after 444364 steps, saw 70095 distinct states, run finished after 1615 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-08 finished in 65978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(p1)))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 5 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
[2024-06-03 03:32:44] [INFO ] Invariant cache hit.
[2024-06-03 03:32:44] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-03 03:32:44] [INFO ] Invariant cache hit.
[2024-06-03 03:32:44] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-03 03:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-06-03 03:32:51] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-03 03:32:52] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-03 03:32:52] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-03 03:32:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-03 03:32:52] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-03 03:32:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-03 03:32:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/218 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:33:01] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 4 ms to minimize.
[2024-06-03 03:33:01] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 3 ms to minimize.
[2024-06-03 03:33:01] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 3 ms to minimize.
[2024-06-03 03:33:02] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:33:02] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-06-03 03:33:02] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-03 03:33:02] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-03 03:33:03] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 364 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 549/549 variables, and 226 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-03 03:33:37] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:33:37] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/549 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 592 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
After SMT, in 60652ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61169 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-09
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-09 finished in 61393 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((p0&&G(p1)))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 4 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-03 03:33:45] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 03:33:45] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-03 03:33:45] [INFO ] Invariant cache hit.
[2024-06-03 03:33:46] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-03 03:33:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-03 03:33:50] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-03 03:33:51] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-03 03:33:51] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-03 03:33:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-03 03:33:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:33:56] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-03 03:33:57] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:33:58] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-03 03:33:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-03 03:33:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 227 constraints, problems are : Problem set: 0 solved, 365 unsolved in 25058 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/592 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-03 03:34:22] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:34:23] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 594 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints]
After SMT, in 55515ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 55521ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55950 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-11 finished in 56155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 131 transition count 306
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 181 place count 96 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 191 place count 91 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 211 place count 91 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 213 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 89 transition count 292
Applied a total of 214 rules in 37 ms. Remains 89 /189 variables (removed 100) and now considering 292/370 (removed 78) transitions.
[2024-06-03 03:34:41] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2024-06-03 03:34:41] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 03:34:42] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-03 03:34:42] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-03 03:34:42] [INFO ] Invariant cache hit.
[2024-06-03 03:34:42] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-03 03:34:42] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-06-03 03:34:42] [INFO ] Redundant transitions in 50 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-03 03:34:42] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-03 03:34:42] [INFO ] Invariant cache hit.
[2024-06-03 03:34:42] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 244 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 284/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 27744 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 48140ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 48144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/189 places, 292/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48664 ms. Remains : 89/189 places, 292/370 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 49 ms :[(NOT p0)]
RANDOM walk for 1062 steps (110 resets) in 10 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 292/292 transitions.
Applied a total of 0 rules in 10 ms. Remains 89 /89 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-06-03 03:35:31] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-03 03:35:31] [INFO ] Invariant cache hit.
[2024-06-03 03:35:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-03 03:35:31] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-03 03:35:31] [INFO ] Invariant cache hit.
[2024-06-03 03:35:31] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-03 03:35:31] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-06-03 03:35:31] [INFO ] Redundant transitions in 57 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-03 03:35:31] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-03 03:35:31] [INFO ] Invariant cache hit.
[2024-06-03 03:35:31] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 244 constraints, problems are : Problem set: 0 solved, 284 unsolved in 22249 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 284/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 27809 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
After SMT, in 50576ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 50581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51134 ms. Remains : 89/89 places, 292/292 transitions.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 93 ms :[(NOT p0)]
RANDOM walk for 1067 steps (107 resets) in 9 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 61 ms.
Product exploration explored 100000 steps with 2 reset in 88 ms.
Built C files in :
/tmp/ltsmin10801841625555811830
[2024-06-03 03:36:23] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-06-03 03:36:23] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:36:23] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-06-03 03:36:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:36:23] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-06-03 03:36:23] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 03:36:23] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10801841625555811830
Running compilation step : cd /tmp/ltsmin10801841625555811830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1494 ms.
Running link step : cd /tmp/ltsmin10801841625555811830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10801841625555811830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1962895118946264778.hoa' '--buchi-type=spotba'
LTSmin run took 980 ms.
FORMULA MedleyA-PT-19-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-15 finished in 103888 ms.
All properties solved by simple procedures.
Total runtime 882355 ms.

BK_STOP 1717385785862

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyA-PT-19, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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