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.r601-tall-171774423900172.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 greatspnxred
Input is BlocksWorld-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 73K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 367K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 81K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 407K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 631K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 175K Jun 7 06:26 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 BlocksWorld-PT-02-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717745782249

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:36:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:36:23] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-07 07:36:23] [INFO ] Transformed 209 places.
[2024-06-07 07:36:23] [INFO ] Transformed 365 transitions.
[2024-06-07 07:36:23] [INFO ] Found NUPN structural information;
[2024-06-07 07:36:23] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12]
[2024-06-07 07:36:23] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 209 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 12 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 209 cols
[2024-06-07 07:36:23] [INFO ] Computed 27 invariants in 23 ms
[2024-06-07 07:36:24] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-07 07:36:24] [INFO ] Invariant cache hit.
[2024-06-07 07:36:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:36:24] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:36:24] [INFO ] Invariant cache hit.
[2024-06-07 07:36:24] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 9 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 17931 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 335/591 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/611 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:36:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:57] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:36:57] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:36:57] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:58] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:36:58] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:36:58] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:36:58] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 3 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 20/631 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:37:11] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:11] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:37:12] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:12] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:37:12] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:37:13] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:37:13] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 646 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 335/361 constraints, Known Traps: 57/57 constraints]
After SMT, in 49383ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 49403ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49846 ms. Remains : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-06-07 07:37:14] [INFO ] Flatten gal took : 79 ms
[2024-06-07 07:37:14] [INFO ] Flatten gal took : 51 ms
[2024-06-07 07:37:14] [INFO ] Input system was already deterministic with 339 transitions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (8 resets) in 4066 ms. (9 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40001 steps (8 resets) in 339 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:37:15] [INFO ] Computed 27 invariants in 3 ms
[2024-06-07 07:37:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 174/196 variables, 27/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 2 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 2 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 837ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 347 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 444 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1224702 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :0 out of 1
Probabilistic random walk after 1224702 steps, saw 855616 distinct states, run finished after 3007 ms. (steps per millisecond=407 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:37:20] [INFO ] Computed 27 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:37:20] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 107 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 80 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:37:20] [INFO ] Invariant cache hit.
[2024-06-07 07:37:21] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-07 07:37:21] [INFO ] Invariant cache hit.
[2024-06-07 07:37:21] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-07 07:37:21] [INFO ] Redundant transitions in 16 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10561 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:37:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:37:40] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:37:40] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:37:40] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:37:41] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
[2024-06-07 07:37:41] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:37:41] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2024-06-07 07:37:41] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:37:42] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:37:42] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:37:42] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:37:42] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:43] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:37:43] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:37:44] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:37:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41663ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42141 ms. Remains : 196/196 places, 338/338 transitions.
FORMULA BlocksWorld-PT-02-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 183 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:38:03] [INFO ] Computed 27 invariants in 4 ms
[2024-06-07 07:38:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-07 07:38:03] [INFO ] Invariant cache hit.
[2024-06-07 07:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:38:03] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-07 07:38:03] [INFO ] Redundant transitions in 5 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:38:03] [INFO ] Invariant cache hit.
[2024-06-07 07:38:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13943 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:38:28] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 5 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:43] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:38:43] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-06-07 07:38:43] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:38:43] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:38:43] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 45049ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 45053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45263 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 5353 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-00 finished in 50892 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) U G(((!X(p1)||G(p2)) U p2))))'
Support contains 34 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:38:54] [INFO ] Invariant cache hit.
[2024-06-07 07:38:54] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-07 07:38:54] [INFO ] Invariant cache hit.
[2024-06-07 07:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:38:54] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:38:54] [INFO ] Invariant cache hit.
[2024-06-07 07:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13558 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:39:16] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:39:17] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:39:18] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:18] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44474ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44478ms
Finished structural reductions in LTL mode , in 1 iterations and 44847 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (AND p0 p1), p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-01
Product exploration explored 100000 steps with 14320 reset in 741 ms.
Stack based approach found an accepted trace after 33 steps with 6 reset with depth 8 and stack size 8 in 1 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-01 finished in 45869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 28 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:39:40] [INFO ] Invariant cache hit.
[2024-06-07 07:39:40] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-06-07 07:39:40] [INFO ] Invariant cache hit.
[2024-06-07 07:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:40] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-06-07 07:39:40] [INFO ] Redundant transitions in 4 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:39:40] [INFO ] Invariant cache hit.
[2024-06-07 07:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13108 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:01] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:01] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:40:04] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:40:04] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:40:05] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:40:05] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 3 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:40:13] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:40:19] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 10 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 5 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44129ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44721 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 542 ms.
Product exploration explored 100000 steps with 0 reset in 686 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 719 ms. (55 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2024-06-07 07:40:27] [INFO ] Invariant cache hit.
[2024-06-07 07:40:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:27] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:27] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 845ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 146 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 632 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 447499 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 2
Probabilistic random walk after 447499 steps, saw 315016 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:40:31] [INFO ] Computed 27 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 569ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 109 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 107 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:40:32] [INFO ] Invariant cache hit.
[2024-06-07 07:40:32] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-07 07:40:32] [INFO ] Invariant cache hit.
[2024-06-07 07:40:32] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-06-07 07:40:32] [INFO ] Redundant transitions in 2 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10673 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:40:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:40:51] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:52] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:40:52] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:40:52] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:40:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:40:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:41:11] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:41:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:41:12] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41662ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42244 ms. Remains : 196/196 places, 338/338 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:41:14] [INFO ] Computed 27 invariants in 5 ms
[2024-06-07 07:41:15] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-07 07:41:15] [INFO ] Invariant cache hit.
[2024-06-07 07:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:41:15] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-06-07 07:41:15] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:41:15] [INFO ] Invariant cache hit.
[2024-06-07 07:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13212 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:41:36] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:41:37] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:41:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:41:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:39] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:39] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:41:47] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:41:47] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44200ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44852 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 366 ms. (108 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2024-06-07 07:42:00] [INFO ] Invariant cache hit.
[2024-06-07 07:42:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 70 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 547 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 390556 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 2
Probabilistic random walk after 390556 steps, saw 276512 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:42:04] [INFO ] Computed 27 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:42:04] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 48 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 48 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:42:04] [INFO ] Invariant cache hit.
[2024-06-07 07:42:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-07 07:42:05] [INFO ] Invariant cache hit.
[2024-06-07 07:42:05] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-07 07:42:05] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:42:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10363 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:42:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:42:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:42:44] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 579 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 22/22 constraints]
After SMT, in 41349ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41722 ms. Remains : 196/196 places, 338/338 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 562 ms.
Product exploration explored 100000 steps with 0 reset in 568 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 21 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:42:48] [INFO ] Computed 27 invariants in 3 ms
[2024-06-07 07:42:48] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-07 07:42:48] [INFO ] Invariant cache hit.
[2024-06-07 07:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:48] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-07 07:42:48] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:42:48] [INFO ] Invariant cache hit.
[2024-06-07 07:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13386 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:43:09] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:09] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:43:10] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:43:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:43:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:43:11] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:43:11] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:43:12] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:43:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:43:13] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:43:19] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:43:20] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:43:20] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:43:20] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:26] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:43:26] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:43:26] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:43:26] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:43:27] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:43:28] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44352ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44694 ms. Remains : 196/196 places, 339/339 transitions.
Treatment of property BlocksWorld-PT-02-LTLFireability-02 finished in 232668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:43:32] [INFO ] Invariant cache hit.
[2024-06-07 07:43:32] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-07 07:43:32] [INFO ] Invariant cache hit.
[2024-06-07 07:43:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:33] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-07 07:43:33] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:43:33] [INFO ] Invariant cache hit.
[2024-06-07 07:43:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13704 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:43:57] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:43:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:43:58] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:43:58] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:44:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:11] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:44:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:14] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:44:14] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:44:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44662ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44969 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 20064 reset in 442 ms.
Product exploration explored 100000 steps with 19928 reset in 475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 20 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:44:19] [INFO ] Invariant cache hit.
[2024-06-07 07:44:19] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-07 07:44:19] [INFO ] Invariant cache hit.
[2024-06-07 07:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:19] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-07 07:44:19] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:44:19] [INFO ] Invariant cache hit.
[2024-06-07 07:44:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13323 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:42] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:44:43] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:44:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
[2024-06-07 07:44:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:44:49] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:44:50] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:44:58] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44466ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44846 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20022 reset in 475 ms.
Product exploration explored 100000 steps with 19990 reset in 472 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:45:05] [INFO ] Invariant cache hit.
[2024-06-07 07:45:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-07 07:45:05] [INFO ] Invariant cache hit.
[2024-06-07 07:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:05] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-07 07:45:05] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:45:05] [INFO ] Invariant cache hit.
[2024-06-07 07:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13479 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:45:28] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:45:29] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:45:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:29] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:45:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:45:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:45:30] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:45:31] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:44] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:45:44] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:45:44] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44566ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44932 ms. Remains : 196/196 places, 339/339 transitions.
Treatment of property BlocksWorld-PT-02-LTLFireability-03 finished in 137745 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' '!((p0||G(p1)||X(p2)))'
Support contains 48 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:45:50] [INFO ] Invariant cache hit.
[2024-06-07 07:45:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-07 07:45:50] [INFO ] Invariant cache hit.
[2024-06-07 07:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:50] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:45:50] [INFO ] Invariant cache hit.
[2024-06-07 07:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13176 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:14] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:46:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:46:15] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:46:20] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:46:23] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44067ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44070ms
Finished structural reductions in LTL mode , in 1 iterations and 44370 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-04 finished in 45057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((!p1 U (!p2||G(!p1))))))'
Support contains 34 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:46:35] [INFO ] Invariant cache hit.
[2024-06-07 07:46:35] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-07 07:46:35] [INFO ] Invariant cache hit.
[2024-06-07 07:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:46:35] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:46:35] [INFO ] Invariant cache hit.
[2024-06-07 07:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13570 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:46:57] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:46:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:46:59] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:46:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:46:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:47:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:47:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:47:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:47:01] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:47:06] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:47:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44530ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44533ms
Finished structural reductions in LTL mode , in 1 iterations and 44829 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-05 finished in 45431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 13 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:47:21] [INFO ] Invariant cache hit.
[2024-06-07 07:47:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-07 07:47:21] [INFO ] Invariant cache hit.
[2024-06-07 07:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:21] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:47:21] [INFO ] Invariant cache hit.
[2024-06-07 07:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13405 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:42] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:47:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:47:44] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:47:44] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:47:44] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:47:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:47:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:47:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:47:46] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:47:46] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:47:51] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:47:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44496ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44500ms
Finished structural reductions in LTL mode , in 1 iterations and 44829 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-07 finished in 44945 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)&&F(G(p1))))'
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 15 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:48:06] [INFO ] Invariant cache hit.
[2024-06-07 07:48:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-07 07:48:06] [INFO ] Invariant cache hit.
[2024-06-07 07:48:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:06] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-07 07:48:06] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:48:06] [INFO ] Invariant cache hit.
[2024-06-07 07:48:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 14093 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:28] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2024-06-07 07:48:28] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:48:28] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:48:31] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:48:31] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:48:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:36] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 45089ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 45093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45448 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 604 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 56 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-08 finished in 46181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:48:52] [INFO ] Invariant cache hit.
[2024-06-07 07:48:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-07 07:48:52] [INFO ] Invariant cache hit.
[2024-06-07 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:52] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:48:52] [INFO ] Invariant cache hit.
[2024-06-07 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13456 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:49:14] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:49:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:49:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:49:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:49:17] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:49:17] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:49:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 12 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:49:25] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:49:25] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:49:25] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:49:33] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:49:34] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:49:34] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44471ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44476ms
Finished structural reductions in LTL mode , in 1 iterations and 44844 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-09 finished in 45310 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 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:49:37] [INFO ] Invariant cache hit.
[2024-06-07 07:49:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-07 07:49:37] [INFO ] Invariant cache hit.
[2024-06-07 07:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:37] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:49:37] [INFO ] Invariant cache hit.
[2024-06-07 07:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13423 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:49:59] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:50:00] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:50:01] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:50:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:50:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:50:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:50:02] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:50:07] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:50:08] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:50:15] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:50:15] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:50:16] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:50:17] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:50:18] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:50:18] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44363ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44366ms
Finished structural reductions in LTL mode , in 1 iterations and 44791 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Product exploration explored 100000 steps with 33333 reset in 358 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-10 finished in 45730 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(F(!p1)))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:50:23] [INFO ] Invariant cache hit.
[2024-06-07 07:50:23] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-07 07:50:23] [INFO ] Invariant cache hit.
[2024-06-07 07:50:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:50:23] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:50:23] [INFO ] Invariant cache hit.
[2024-06-07 07:50:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13166 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:50:44] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:50:44] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:50:44] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:50:45] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:50:46] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:50:46] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:50:46] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:50:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:50:47] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:50:48] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:50:48] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:50:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:50:56] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:02] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:51:02] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:51:02] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:51:02] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:51:02] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44103ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44106ms
Finished structural reductions in LTL mode , in 1 iterations and 44444 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-11
Product exploration explored 100000 steps with 4177 reset in 464 ms.
Stack based approach found an accepted trace after 206 steps with 12 reset with depth 11 and stack size 9 in 1 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-11 finished in 45012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:51:08] [INFO ] Invariant cache hit.
[2024-06-07 07:51:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-07 07:51:08] [INFO ] Invariant cache hit.
[2024-06-07 07:51:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:51:08] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:51:08] [INFO ] Invariant cache hit.
[2024-06-07 07:51:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13828 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:51:32] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:51:32] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:51:32] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:51:32] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:51:33] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:51:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:51:34] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:51:40] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:47] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:51:47] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:51:47] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:51:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:51:50] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44808ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44812ms
Finished structural reductions in LTL mode , in 1 iterations and 45133 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-13 finished in 45586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)&&X((G(p2) U p3))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:51:53] [INFO ] Invariant cache hit.
[2024-06-07 07:51:53] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:51:53] [INFO ] Invariant cache hit.
[2024-06-07 07:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:51:54] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:51:54] [INFO ] Invariant cache hit.
[2024-06-07 07:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13973 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:52:17] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:52:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:52:18] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:52:19] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:52:19] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:52:19] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:52:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:52:24] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:52:24] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:52:25] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:52:33] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:52:33] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:52:36] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:52:36] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:52:36] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44904ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44908ms
Finished structural reductions in LTL mode , in 1 iterations and 45264 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p3) (NOT p1)), (NOT p3), (OR (NOT p0) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-14 finished in 45496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:52:39] [INFO ] Invariant cache hit.
[2024-06-07 07:52:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-07 07:52:39] [INFO ] Invariant cache hit.
[2024-06-07 07:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:52:39] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:52:39] [INFO ] Invariant cache hit.
[2024-06-07 07:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13825 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:01] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:53:04] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44958ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44962ms
Finished structural reductions in LTL mode , in 1 iterations and 45325 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 1171 reset in 499 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-15 finished in 45996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-07 07:53:25] [INFO ] Flatten gal took : 33 ms
[2024-06-07 07:53:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-07 07:53:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 339 transitions and 1680 arcs took 6 ms.
Total runtime 1022283 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 196
TRANSITIONS: 339
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


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


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

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

Process ID: 5029
MODEL NAME: /home/mcc/execution/414/model
196 places, 339 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-02, 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 r601-tall-171774423900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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