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.r480-tall-171624189900714.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DES-PT-40a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717195358912

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:42:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:42:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:42:40] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 22:42:40] [INFO ] Transformed 274 places.
[2024-05-31 22:42:40] [INFO ] Transformed 231 transitions.
[2024-05-31 22:42:40] [INFO ] Found NUPN structural information;
[2024-05-31 22:42:40] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 99 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 24 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2024-05-31 22:42:40] [INFO ] Computed 59 invariants in 29 ms
[2024-05-31 22:42:40] [INFO ] Implicit Places using invariants in 416 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 19 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 515 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 99 out of 273 places after structural reductions.
[2024-05-31 22:42:41] [INFO ] Flatten gal took : 59 ms
[2024-05-31 22:42:41] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:42:41] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 95 out of 273 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (889 resets) in 1773 ms. (22 steps per ms) remains 37/53 properties
BEST_FIRST walk for 4003 steps (22 resets) in 53 ms. (74 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (18 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (21 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (25 resets) in 55 ms. (71 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (22 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (25 resets) in 62 ms. (63 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (11 resets) in 53 ms. (74 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (24 resets) in 66 ms. (59 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (21 resets) in 48 ms. (81 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (17 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (22 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (19 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
// Phase 1: matrix 217 rows 273 cols
[2024-05-31 22:42:42] [INFO ] Computed 58 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 22/79 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 45/124 variables, 21/112 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 45/157 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 113/237 variables, 23/181 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 113/294 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/240 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 15 (OVERLAPS) 216/456 variables, 240/538 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/538 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 17 (OVERLAPS) 34/490 variables, 33/571 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 33/604 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 604 constraints, problems are : Problem set: 1 solved, 36 unsolved in 5018 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 22/76 variables, 12/66 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 22/88 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 45/121 variables, 21/109 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 45/154 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 116/237 variables, 23/178 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 116/294 constraints. Problems are: Problem set: 1 solved, 36 unsolved
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 19 ms to minimize.
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 3/240 variables, 1/298 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 3/301 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 216/456 variables, 240/541 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/456 variables, 7/548 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/490 variables, and 548 constraints, problems are : Problem set: 1 solved, 36 unsolved in 5008 ms.
Refiners :[Domain max(s): 240/273 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/273 constraints, PredecessorRefiner: 7/37 constraints, Known Traps: 3/3 constraints]
After SMT, in 10122ms problems are : Problem set: 1 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 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 273 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 272 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 272 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 215
Applied a total of 4 rules in 45 ms. Remains 272 /273 variables (removed 1) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 272/273 places, 215/217 transitions.
RANDOM walk for 40000 steps (656 resets) in 524 ms. (76 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4002 steps (24 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (23 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (17 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 653587 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 35
Probabilistic random walk after 653587 steps, saw 97225 distinct states, run finished after 3004 ms. (steps per millisecond=217 ) properties seen :0
// Phase 1: matrix 215 rows 272 cols
[2024-05-31 22:42:56] [INFO ] Computed 59 invariants in 8 ms
[2024-05-31 22:42:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 17/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 55/120 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 119/239 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/242 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 215/457 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 30/487 variables, 30/332 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/487 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 337 constraints, problems are : Problem set: 0 solved, 35 unsolved in 6270 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 272/272 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 17/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 55/120 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 119/239 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 3/242 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 215/457 variables, 242/306 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 30/487 variables, 30/344 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 28/372 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 374 constraints, problems are : Problem set: 0 solved, 35 unsolved in 41483 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 272/272 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 47810ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 0 properties in 7159 ms.
Support contains 48 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 215/215 transitions.
Applied a total of 0 rules in 17 ms. Remains 272 /272 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 272/272 places, 215/215 transitions.
RANDOM walk for 40000 steps (663 resets) in 358 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (22 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (24 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 732317 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 35
Probabilistic random walk after 732317 steps, saw 106914 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2024-05-31 22:43:54] [INFO ] Invariant cache hit.
[2024-05-31 22:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 17/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 55/120 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 119/239 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 3/242 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 215/457 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 30/487 variables, 30/332 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:43:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:43:56] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:43:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 335 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 272/272 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 17/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 55/120 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 119/239 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 3/242 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 215/457 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:44:00] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 30/487 variables, 30/342 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 28/370 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-31 22:44:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:44:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:44:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 374 constraints, problems are : Problem set: 0 solved, 35 unsolved in 38084 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 272/272 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 42356ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 2 properties in 6677 ms.
Support contains 46 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 215/215 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 19 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 217 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 19 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 8 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 18 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:44:43] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:44:43] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 40000 steps (867 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (202 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1470055 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :0 out of 1
Probabilistic random walk after 1470055 steps, saw 205609 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
// Phase 1: matrix 216 rows 272 cols
[2024-05-31 22:44:47] [INFO ] Computed 58 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/224 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/230 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/445 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/488 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/79 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/224 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/230 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/445 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/488 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/488 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 303 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 35 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 272/272 places, 214/216 transitions.
RANDOM walk for 4000000 steps (53764 resets) in 13532 ms. (295 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (9586 resets) in 4718 ms. (847 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6035971 steps, run timeout after 12001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 6035971 steps, saw 772783 distinct states, run finished after 12001 ms. (steps per millisecond=502 ) properties seen :0
// Phase 1: matrix 214 rows 272 cols
[2024-05-31 22:45:04] [INFO ] Computed 60 invariants in 8 ms
[2024-05-31 22:45:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:45:04] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/447 variables, 233/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 39/486 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/486 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/447 variables, 233/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 39/486 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 311 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 22:45:05] [INFO ] Invariant cache hit.
[2024-05-31 22:45:05] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 22:45:05] [INFO ] Invariant cache hit.
[2024-05-31 22:45:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:45:05] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-31 22:45:05] [INFO ] Redundant transitions in 11 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-31 22:45:05] [INFO ] Invariant cache hit.
[2024-05-31 22:45:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/486 variables, 272/332 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:45:10] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:45:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:45:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/486 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/486 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 343 constraints, problems are : Problem set: 0 solved, 213 unsolved in 21222 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/486 variables, 272/341 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 213/556 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:45:42] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:45:43] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:45] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 563 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 16/16 constraints]
After SMT, in 51381ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 51385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51938 ms. Remains : 272/272 places, 214/214 transitions.
RANDOM walk for 400000 steps (5379 resets) in 3107 ms. (128 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 22:45:58] [INFO ] Invariant cache hit.
[2024-05-31 22:45:58] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:45:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2024-05-31 22:45:58] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:45:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:45:58] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:45:58] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:45:58] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:45:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:45:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 22:45:58] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:45:58] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:45:58] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:45:58] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (53851 resets) in 14832 ms. (269 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (9645 resets) in 4754 ms. (841 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7537783 steps, run timeout after 15001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 7537783 steps, saw 968225 distinct states, run finished after 15001 ms. (steps per millisecond=502 ) properties seen :0
[2024-05-31 22:46:18] [INFO ] Invariant cache hit.
[2024-05-31 22:46:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/447 variables, 233/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/486 variables, 39/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/486 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/233 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:46:18] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/447 variables, 233/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 39/486 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:46:19] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-31 22:46:19] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 309 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 22:46:19] [INFO ] Invariant cache hit.
[2024-05-31 22:46:19] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-31 22:46:19] [INFO ] Invariant cache hit.
[2024-05-31 22:46:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:46:19] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-31 22:46:19] [INFO ] Redundant transitions in 9 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-31 22:46:19] [INFO ] Invariant cache hit.
[2024-05-31 22:46:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/486 variables, 272/332 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:46:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:46:32] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/486 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 0/486 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 343 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20747 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/486 variables, 272/341 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 213/556 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 22:46:56] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
[2024-05-31 22:46:57] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:46:59] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:47:00] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:47:00] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:47:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:47:08] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 563 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 16/16 constraints]
After SMT, in 50879ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 50881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51384 ms. Remains : 272/272 places, 214/214 transitions.
RANDOM walk for 400000 steps (5360 resets) in 1420 ms. (281 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 22:47:11] [INFO ] Invariant cache hit.
[2024-05-31 22:47:11] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 22:47:11] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:47:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:47:11] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:47:11] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:11] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 22:47:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 22:47:11] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:47:11] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:47:11] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:47:11] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (524 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (94 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1437298 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :0 out of 1
Probabilistic random walk after 1437298 steps, saw 200671 distinct states, run finished after 3001 ms. (steps per millisecond=478 ) properties seen :0
[2024-05-31 22:47:14] [INFO ] Invariant cache hit.
[2024-05-31 22:47:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/47 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/48 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/129 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/277 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 209/486 variables, 266/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/486 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/47 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/48 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/129 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 148/277 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 209/486 variables, 266/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2424 steps, including 110 resets, run visited all 1 properties in 18 ms. (steps per millisecond=134 )
Parikh walk visited 1 properties in 28 ms.
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 22:47:15] [INFO ] Invariant cache hit.
[2024-05-31 22:47:15] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 22:47:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 22:47:15] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:47:15] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:47:15] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 325 ms.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 7 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 13 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 4 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 14 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 271/273 places, 215/217 transitions.
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:15] [INFO ] Input system was already deterministic with 215 transitions.
RANDOM walk for 40000 steps (901 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (182 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1465410 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1465410 steps, saw 205017 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
// Phase 1: matrix 215 rows 271 cols
[2024-05-31 22:47:18] [INFO ] Computed 58 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 150/155 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/213 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/220 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 169/389 variables, 220/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/403 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 43/446 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/446 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/486 variables, 40/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/486 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/486 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/155 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/213 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/220 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 169/389 variables, 220/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/403 variables, 8/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 43/446 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/446 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/446 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/486 variables, 40/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/486 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/486 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 294 ms.
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/271 places, 213/215 transitions.
RANDOM walk for 4000000 steps (65327 resets) in 13597 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (11780 resets) in 4797 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6028267 steps, run timeout after 12001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 6028267 steps, saw 766991 distinct states, run finished after 12001 ms. (steps per millisecond=502 ) properties seen :0
// Phase 1: matrix 213 rows 271 cols
[2024-05-31 22:47:36] [INFO ] Computed 60 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 153/158 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/189 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/213 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/220 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/388 variables, 220/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/402 variables, 8/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/403 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/445 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/484 variables, 39/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/484 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/158 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/189 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/213 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/220 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/388 variables, 220/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/402 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/402 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/403 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/445 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/484 variables, 39/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/484 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 930 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=103 )
FORMULA DES-PT-40a-CTLFireability-2023-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 13 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 11 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 272/273 places, 216/217 transitions.
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:47:37] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 22:47:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 217 transitions and 1049 arcs took 2 ms.
Total runtime 297003 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-40a-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-40a-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-40a-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-40a-CTLFireability-2023-15

BK_STOP 1717195657598

--------------------
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
mcc2024
ctl formula name DES-PT-40a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/799/ctl_0_
ctl formula name DES-PT-40a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/799/ctl_1_
ctl formula name DES-PT-40a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/799/ctl_2_
ctl formula name DES-PT-40a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/799/ctl_3_
ctl formula name DES-PT-40a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/799/ctl_4_
ctl formula name DES-PT-40a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/799/ctl_5_
ctl formula name DES-PT-40a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/799/ctl_6_
ctl formula name DES-PT-40a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/799/ctl_7_
ctl formula name DES-PT-40a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/799/ctl_8_
ctl formula name DES-PT-40a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/799/ctl_9_
ctl formula name DES-PT-40a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/799/ctl_10_
ctl formula name DES-PT-40a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/799/ctl_11_
ctl formula name DES-PT-40a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/799/ctl_12_
ctl formula name DES-PT-40a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/799/ctl_13_
ctl formula name DES-PT-40a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/799/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="DES-PT-40a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-40a, 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 r480-tall-171624189900714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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