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-171774423900170.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900170
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717745505202

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:31:46] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-07 07:31:46] [INFO ] Transformed 209 places.
[2024-06-07 07:31:46] [INFO ] Transformed 365 transitions.
[2024-06-07 07:31:46] [INFO ] Found NUPN structural information;
[2024-06-07 07:31:46] [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:31:46] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
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:31:46] [INFO ] Computed 27 invariants in 25 ms
[2024-06-07 07:31:46] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-07 07:31:46] [INFO ] Invariant cache hit.
[2024-06-07 07:31:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:31:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:31:47] [INFO ] Invariant cache hit.
[2024-06-07 07:31:47] [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:31:51] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 9 ms to minimize.
[2024-06-07 07:31:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 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 18252 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:32:14] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
[2024-06-07 07:32:14] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:32:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:32:14] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:32:14] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 5 ms to minimize.
[2024-06-07 07:32:15] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:32:16] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:32:16] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:32:16] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:32:16] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:32:16] [INFO ] Deduced a trap composed of 54 places in 70 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:32:20] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:32:20] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:32:21] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:32:22] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 12 ms to minimize.
[2024-06-07 07:32:23] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:32:24] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 3 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:32:25] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 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:32:32] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:32:32] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:32:33] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:32:35] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:32:36] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 643 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30018 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: 54/54 constraints]
After SMT, in 49682ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 49705ms
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 1 ms
Applied a total of 0 rules in 4 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 50127 ms. Remains : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-06-07 07:32:37] [INFO ] Flatten gal took : 82 ms
[2024-06-07 07:32:37] [INFO ] Flatten gal took : 72 ms
[2024-06-07 07:32:37] [INFO ] Input system was already deterministic with 339 transitions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (8 resets) in 3320 ms. (12 steps per ms) remains 9/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 908 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:32:39] [INFO ] Computed 27 invariants in 4 ms
[2024-06-07 07:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 12/196 variables, 12/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 7 solved, 2 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 7 solved, 2 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 183 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 56 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 58 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 734 ms. (54 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 472648 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 472648 steps, saw 331748 distinct states, run finished after 3004 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:32:44] [INFO ] Computed 27 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (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 195 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/183 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 183 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 17 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 17 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 15 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:32:45] [INFO ] Invariant cache hit.
[2024-06-07 07:32:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-07 07:32:45] [INFO ] Invariant cache hit.
[2024-06-07 07:32:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-07 07:32:45] [INFO ] Redundant transitions in 20 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:32:45] [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 11089 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:33:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:33:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 26 places in 38 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:33:16] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:16] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 26 places in 37 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:33:24] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:33:25] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:33:26] [INFO ] Deduced a trap composed of 44 places in 45 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 42159ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 42162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42398 ms. Remains : 196/196 places, 338/338 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-06-07 07:33:27] [INFO ] Flatten gal took : 36 ms
[2024-06-07 07:33:28] [INFO ] Flatten gal took : 41 ms
[2024-06-07 07:33:28] [INFO ] Input system was already deterministic with 339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 26 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:33:28] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:33:28] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:33:28] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL 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.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:33:28] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:33:28] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:33:28] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (8 resets) in 544 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1270229 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1270229 steps, saw 887472 distinct states, run finished after 3003 ms. (steps per millisecond=422 ) properties seen :0
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:33:31] [INFO ] Computed 27 invariants in 6 ms
[2024-06-07 07:33:31] [INFO ] State equation strengthened by 1 read => feed constraints.
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:33:31] [INFO ] Deduced a trap composed of 50 places in 54 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) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 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) 1/535 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 0 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/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 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 397 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 399 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23882 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6140 ms. (651 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9149769 steps, run timeout after 21001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 9149769 steps, saw 6291523 distinct states, run finished after 21003 ms. (steps per millisecond=435 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:34:01] [INFO ] Computed 27 invariants in 5 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:34:01] [INFO ] Deduced a trap composed of 50 places in 53 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 220 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 147 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 378ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 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 82 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 82 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 239 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:34:01] [INFO ] Invariant cache hit.
[2024-06-07 07:34:02] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-07 07:34:02] [INFO ] Invariant cache hit.
[2024-06-07 07:34:02] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-07 07:34:02] [INFO ] Redundant transitions in 6 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:34:02] [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 10358 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:34:20] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:20] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:34:20] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:34:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:34:21] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:21] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:21] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:22] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:22] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:34:22] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:34:22] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-07 07:34:23] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:34:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:34:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:34:25] [INFO ] Deduced a trap composed of 26 places in 30 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:34:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:34:32] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:34:33] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 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:34:39] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [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 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30013 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 41221ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41818 ms. Remains : 196/196 places, 338/338 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23672 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6045 ms. (661 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9307064 steps, run timeout after 21001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 9307064 steps, saw 6397660 distinct states, run finished after 21001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-07 07:35:12] [INFO ] Invariant cache hit.
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
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 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: 0/0 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, 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
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 Int declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 75 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 75 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 74 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:35:12] [INFO ] Invariant cache hit.
[2024-06-07 07:35:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-07 07:35:13] [INFO ] Invariant cache hit.
[2024-06-07 07:35:13] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-07 07:35:13] [INFO ] Redundant transitions in 2 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:35:13] [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 10983 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:35:32] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:32] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:35:32] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:35:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:35:36] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:35:37] [INFO ] Deduced a trap composed of 26 places in 40 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:35:43] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:35:45] [INFO ] Deduced a trap composed of 26 places in 41 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:35:51] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 44 places in 39 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 30015 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 41881ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42293 ms. Remains : 196/196 places, 338/338 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 19 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 24 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 10 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL 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.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:35:55] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:35:55] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1382182 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1382182 steps, saw 965584 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:35:58] [INFO ] Computed 27 invariants in 4 ms
[2024-06-07 07:35:58] [INFO ] State equation strengthened by 1 read => feed constraints.
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:35:58] [INFO ] Deduced a trap composed of 50 places in 57 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) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 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) 1/535 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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 95 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 95 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23962 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6202 ms. (644 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9328924 steps, run timeout after 21001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 9328924 steps, saw 6412423 distinct states, run finished after 21001 ms. (steps per millisecond=444 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:36:28] [INFO ] Computed 27 invariants in 5 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:36:28] [INFO ] Deduced a trap composed of 50 places in 69 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 233 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 131 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 375ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 70 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 70 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 70 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:36:28] [INFO ] Invariant cache hit.
[2024-06-07 07:36:28] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:36:28] [INFO ] Invariant cache hit.
[2024-06-07 07:36:29] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-07 07:36:29] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:36:29] [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 10522 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:36:47] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:47] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:36:47] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:36:47] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:48] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:48] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:36:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:36:49] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:36:49] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:36:49] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:36:50] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:36:50] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:36:50] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:36:51] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:36:52] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 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:36:58] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:36:59] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:37:00] [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:37:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 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:08] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30023 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 41509ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41898 ms. Remains : 196/196 places, 338/338 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24438 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6116 ms. (653 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9159023 steps, run timeout after 21001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 9159023 steps, saw 6297732 distinct states, run finished after 21001 ms. (steps per millisecond=436 ) properties seen :0
[2024-06-07 07:37:39] [INFO ] Invariant cache hit.
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:39] [INFO ] Deduced a trap composed of 50 places in 64 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 230 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 135 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 372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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 78 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 78 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:39] [INFO ] Invariant cache hit.
[2024-06-07 07:37:40] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-07 07:37:40] [INFO ] Invariant cache hit.
[2024-06-07 07:37:40] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-07 07:37:40] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:37:40] [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 10323 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:58] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 26 places in 38 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:38:10] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 26 places in 37 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:18] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 44 places in 51 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 30019 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 41419ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41848 ms. Remains : 196/196 places, 338/338 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 17 ms
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:38:21] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:38:21] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 25 ms
[2024-06-07 07:38:21] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:38:21] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:38:21] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:38:21] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:38:22] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:38:22] [INFO ] Input system was already deterministic with 339 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:38:22] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 36 ms
[2024-06-07 07:38:22] [INFO ] Flatten gal took : 32 ms
[2024-06-07 07:38:22] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 25 ms.
[2024-06-07 07:38:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 339 transitions and 1680 arcs took 5 ms.
Total runtime 396241 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/409/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/409/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: 1229
MODEL NAME: /home/mcc/execution/409/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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-171774423900170"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;