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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717371639196

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:40:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:40:40] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 23:40:40] [INFO ] Transformed 428 places.
[2024-06-02 23:40:40] [INFO ] Transformed 656 transitions.
[2024-06-02 23:40:40] [INFO ] Found NUPN structural information;
[2024-06-02 23:40:40] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 101 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 71 place count 357 transition count 591
Iterating global reduction 1 with 65 rules applied. Total rules applied 136 place count 357 transition count 591
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 147 place count 346 transition count 580
Iterating global reduction 1 with 11 rules applied. Total rules applied 158 place count 346 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 159 place count 346 transition count 579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 343 transition count 576
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 343 transition count 576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 342 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 342 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 341 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 341 transition count 574
Applied a total of 169 rules in 99 ms. Remains 341 /428 variables (removed 87) and now considering 574/656 (removed 82) transitions.
// Phase 1: matrix 574 rows 341 cols
[2024-06-02 23:40:40] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 23:40:41] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-02 23:40:41] [INFO ] Invariant cache hit.
[2024-06-02 23:40:41] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 573 sub problems to find dead transitions.
[2024-06-02 23:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 23:40:47] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 20 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:40:49] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:40:49] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:40:49] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 99 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 3 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:40:51] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:40:54] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:40:54] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 23:40:54] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:40:55] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:40:56] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 167 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 23:41:03] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:41:04] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:41:04] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:41:04] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:41:04] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:41:05] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:41:05] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/915 variables, and 41 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (OVERLAPS) 574/915 variables, 341/382 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 573/955 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 23:41:24] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 5 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 171 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:41:27] [INFO ] Deduced a trap composed of 160 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 3 ms to minimize.
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 177 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:41:31] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 8/963 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 963 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 42/42 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 341/428 places, 574/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61122 ms. Remains : 341/428 places, 574/656 transitions.
Support contains 101 out of 341 places after structural reductions.
[2024-06-02 23:41:41] [INFO ] Flatten gal took : 65 ms
[2024-06-02 23:41:42] [INFO ] Flatten gal took : 34 ms
[2024-06-02 23:41:42] [INFO ] Input system was already deterministic with 574 transitions.
Support contains 100 out of 341 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 1168 ms. (34 steps per ms) remains 56/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
[2024-06-02 23:41:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/306 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-06-02 23:41:43] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:41:43] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:41:43] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-06-02 23:41:44] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:41:44] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/318 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 26/872 variables, 12/330 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-06-02 23:41:46] [INFO ] Deduced a trap composed of 175 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/872 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 22/894 variables, 12/343 constraints. Problems are: Problem set: 2 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/915 variables, and 343 constraints, problems are : Problem set: 2 solved, 54 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 330/341 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 231/306 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-06-02 23:41:48] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:41:48] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/321 constraints. Problems are: Problem set: 2 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 53/374 constraints. Problems are: Problem set: 2 solved, 54 unsolved
[2024-06-02 23:41:50] [INFO ] Deduced a trap composed of 163 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:41:50] [INFO ] Deduced a trap composed of 158 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:41:51] [INFO ] Deduced a trap composed of 155 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:41:51] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:41:51] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:41:51] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 6/380 constraints. Problems are: Problem set: 2 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/915 variables, and 380 constraints, problems are : Problem set: 2 solved, 54 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/341 constraints, PredecessorRefiner: 53/56 constraints, Known Traps: 14/14 constraints]
After SMT, in 10073ms problems are : Problem set: 2 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 189 edges and 341 vertex of which 10 / 341 are part of one of the 2 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 333 transition count 511
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 282 transition count 509
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 281 transition count 505
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 116 place count 277 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 276 transition count 503
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 117 place count 276 transition count 487
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 149 place count 260 transition count 487
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 154 place count 255 transition count 482
Iterating global reduction 5 with 5 rules applied. Total rules applied 159 place count 255 transition count 482
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 229 place count 220 transition count 447
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 263 place count 203 transition count 524
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 281 place count 203 transition count 506
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 299 place count 185 transition count 506
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 301 place count 185 transition count 504
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 307 place count 185 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 309 place count 185 transition count 502
Applied a total of 309 rules in 154 ms. Remains 185 /341 variables (removed 156) and now considering 502/574 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 185/341 places, 502/574 transitions.
RANDOM walk for 40000 steps (1561 resets) in 772 ms. (51 steps per ms) remains 38/54 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (30 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (31 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (31 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
[2024-06-02 23:41:53] [INFO ] Flow matrix only has 488 transitions (discarded 14 similar events)
// Phase 1: matrix 488 rows 185 cols
[2024-06-02 23:41:53] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:41:53] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:54] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:54] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:41:54] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:54] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:54] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 488/668 variables, 180/192 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 12/204 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 5/673 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 209 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 488/668 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 33/238 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 5/673 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 23:41:59] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 0/673 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 246 constraints, problems are : Problem set: 0 solved, 34 unsolved in 6830 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 8/8 constraints]
After SMT, in 9212ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 2 properties in 10968 ms.
Support contains 51 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 502/502 transitions.
Graph (trivial) has 42 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 184 transition count 498
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 181 transition count 497
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 9 place count 179 transition count 495
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 179 transition count 495
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 23 place count 173 transition count 489
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 28 place count 173 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 34 place count 170 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 4 with 52 rules applied. Total rules applied 86 place count 170 transition count 474
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 170 transition count 468
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 98 place count 164 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 100 place count 164 transition count 466
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 164 transition count 466
Applied a total of 101 rules in 118 ms. Remains 164 /185 variables (removed 21) and now considering 466/502 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 164/185 places, 466/502 transitions.
RANDOM walk for 40000 steps (1413 resets) in 400 ms. (99 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (33 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (37 resets) in 19 ms. (200 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (26 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (37 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (31 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (29 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (36 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (28 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
[2024-06-02 23:42:14] [INFO ] Flow matrix only has 447 transitions (discarded 19 similar events)
// Phase 1: matrix 447 rows 164 cols
[2024-06-02 23:42:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:42:14] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 116/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 23:42:14] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 5/159 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:42:15] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 447/606 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 5/611 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/611 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/611 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 223 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 116/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 23:42:16] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 5/159 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 23:42:16] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 447/606 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 43/220 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 23/243 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 5/611 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/611 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 249 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 11/11 constraints]
After SMT, in 4853ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 4813 ms.
Support contains 38 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 466/466 transitions.
Graph (trivial) has 25 edges and 164 vertex of which 4 / 164 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 160 transition count 431
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 160 transition count 429
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 158 transition count 429
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 154 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 154 transition count 439
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 154 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 153 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 41 place count 153 transition count 420
Applied a total of 41 rules in 37 ms. Remains 153 /164 variables (removed 11) and now considering 420/466 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 153/164 places, 420/466 transitions.
RANDOM walk for 40000 steps (1549 resets) in 278 ms. (143 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (17 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (30 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (33 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (20 resets) in 24 ms. (160 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
[2024-06-02 23:42:24] [INFO ] Flow matrix only has 405 transitions (discarded 15 similar events)
// Phase 1: matrix 405 rows 153 cols
[2024-06-02 23:42:24] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:42:24] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 110/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 4/148 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 23:42:25] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 405/553 variables, 148/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 40/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 5/558 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/558 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 207 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 110/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 4/148 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 405/553 variables, 148/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 40/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 5/558 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 229 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
After SMT, in 3825ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 1910 ms.
Support contains 34 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 420/420 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 151 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 150 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 150 transition count 417
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 150 transition count 416
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 149 transition count 413
Applied a total of 15 rules in 25 ms. Remains 149 /153 variables (removed 4) and now considering 413/420 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 149/153 places, 413/420 transitions.
RANDOM walk for 40000 steps (1591 resets) in 323 ms. (123 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (41 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
[2024-06-02 23:42:30] [INFO ] Flow matrix only has 398 transitions (discarded 15 similar events)
// Phase 1: matrix 398 rows 149 cols
[2024-06-02 23:42:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:42:30] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 109/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 3 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:42:30] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/144 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 398/542 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 42/199 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 5/547 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/547 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 204 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 109/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:42:31] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 4/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 23:42:31] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 398/542 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 42/201 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 17/218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 5/547 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 224 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 8/8 constraints]
After SMT, in 3011ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 2093 ms.
Support contains 31 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 413/413 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 412
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 148 transition count 411
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 9 place count 147 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 147 transition count 397
Applied a total of 18 rules in 17 ms. Remains 147 /149 variables (removed 2) and now considering 397/413 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 147/149 places, 397/413 transitions.
RANDOM walk for 40000 steps (1675 resets) in 241 ms. (165 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (41 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (41 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (19 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (41 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (45 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 341848 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :1 out of 18
Probabilistic random walk after 341848 steps, saw 104953 distinct states, run finished after 3008 ms. (steps per millisecond=113 ) properties seen :1
[2024-06-02 23:42:38] [INFO ] Flow matrix only has 357 transitions (discarded 40 similar events)
// Phase 1: matrix 357 rows 147 cols
[2024-06-02 23:42:38] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:42:38] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 109/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 4/142 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 23:42:38] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:42:38] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:42:38] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:42:38] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 357/499 variables, 142/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 49/202 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 23:42:39] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 5/504 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 208 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 109/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 23:42:39] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 4/142 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 23:42:40] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 357/499 variables, 142/156 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 49/205 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 16/221 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 5/504 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/504 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 227 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 2994ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 864 ms.
Support contains 29 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 397/397 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 147 transition count 396
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 396
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 144 transition count 394
Applied a total of 6 rules in 11 ms. Remains 144 /147 variables (removed 3) and now considering 394/397 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 144/147 places, 394/397 transitions.
RANDOM walk for 40000 steps (1698 resets) in 286 ms. (139 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (39 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (40 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (48 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (39 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (43 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (45 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (43 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 383138 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :2 out of 17
Probabilistic random walk after 383138 steps, saw 118693 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :2
[2024-06-02 23:42:45] [INFO ] Flow matrix only has 354 transitions (discarded 40 similar events)
// Phase 1: matrix 354 rows 144 cols
[2024-06-02 23:42:45] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:42:45] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 105/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:42:45] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 8/139 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:42:45] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:42:45] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 354/493 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 49/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 5/498 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 204 constraints, problems are : Problem set: 0 solved, 15 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 105/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 8/139 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 354/493 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 49/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 14/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 5/498 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/498 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 220 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints]
After SMT, in 2387ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 9981 ms.
Support contains 26 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 394/394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 144 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 142 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 142 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 141 transition count 391
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 141 transition count 390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 140 transition count 390
Applied a total of 8 rules in 17 ms. Remains 140 /144 variables (removed 4) and now considering 390/394 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 140/144 places, 390/394 transitions.
RANDOM walk for 40000 steps (1670 resets) in 212 ms. (187 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (38 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (42 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 445321 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 15
Probabilistic random walk after 445321 steps, saw 133819 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-06-02 23:43:01] [INFO ] Flow matrix only has 350 transitions (discarded 40 similar events)
// Phase 1: matrix 350 rows 140 cols
[2024-06-02 23:43:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:43:01] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 102/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:43:01] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:43:01] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 7/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:43:01] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:43:01] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 350/485 variables, 135/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 5/490 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/490 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 200 constraints, problems are : Problem set: 0 solved, 15 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 102/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:43:02] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 7/135 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 350/485 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 49/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 14/210 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 23:43:02] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:43:02] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 5/490 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/490 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 218 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1888 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 7/7 constraints]
After SMT, in 2875ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 1 properties in 20483 ms.
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 390/390 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 140 transition count 389
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 139 transition count 389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 138 transition count 388
Applied a total of 4 rules in 8 ms. Remains 138 /140 variables (removed 2) and now considering 388/390 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 138/140 places, 388/390 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:43:24] [INFO ] Input system was already deterministic with 574 transitions.
Computed a total of 48 stabilizing places and 52 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 544
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 544
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 304 transition count 512
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 304 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 304 transition count 511
Applied a total of 75 rules in 12 ms. Remains 304 /341 variables (removed 37) and now considering 511/574 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 304/341 places, 511/574 transitions.
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:43:24] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 544
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 544
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 303 transition count 510
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 303 transition count 510
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 303 transition count 508
Applied a total of 78 rules in 12 ms. Remains 303 /341 variables (removed 38) and now considering 508/574 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:43:24] [INFO ] Input system was already deterministic with 508 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 312 transition count 542
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 312 transition count 542
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 300 transition count 508
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 300 transition count 508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 506
Applied a total of 84 rules in 27 ms. Remains 300 /341 variables (removed 41) and now considering 506/574 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 300/341 places, 506/574 transitions.
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:43:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:43:25] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 12 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:43:25] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 313 transition count 544
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 313 transition count 544
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 300 transition count 507
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 300 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 505
Applied a total of 84 rules in 13 ms. Remains 300 /341 variables (removed 41) and now considering 505/574 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 300/341 places, 505/574 transitions.
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:43:25] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 273 edges and 341 vertex of which 19 / 341 are part of one of the 3 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 324 transition count 492
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 133 place count 260 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 258 transition count 488
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 135 place count 258 transition count 469
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 173 place count 239 transition count 469
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 195 place count 217 transition count 444
Iterating global reduction 3 with 22 rules applied. Total rules applied 217 place count 217 transition count 444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 217 place count 217 transition count 436
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 233 place count 209 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 204 transition count 408
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 204 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 247 place count 204 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 202 transition count 404
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 291 place count 181 transition count 383
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 179 transition count 361
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 179 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 179 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 177 transition count 358
Applied a total of 298 rules in 102 ms. Remains 177 /341 variables (removed 164) and now considering 358/574 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:43:25] [INFO ] Input system was already deterministic with 358 transitions.
RANDOM walk for 40000 steps (2198 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (462 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1783254 steps, run timeout after 3001 ms. (steps per millisecond=594 ) properties seen :0 out of 1
Probabilistic random walk after 1783254 steps, saw 376248 distinct states, run finished after 3001 ms. (steps per millisecond=594 ) properties seen :0
[2024-06-02 23:43:28] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 177 cols
[2024-06-02 23:43:28] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:43:28] [INFO ] State equation strengthened by 22 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/345 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 126/471 variables, 59/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/486 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/516 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/520 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/529 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/530 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/530 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/345 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 126/471 variables, 59/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/486 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 9/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/516 variables, 18/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/520 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/529 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/530 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/530 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 358/358 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 177 transition count 353
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 177 transition count 351
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 175 transition count 351
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 167 transition count 343
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 60 rules applied. Total rules applied 85 place count 137 transition count 442
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 137 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 125 place count 137 transition count 402
Free-agglomeration rule applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 146 place count 137 transition count 381
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 173 place count 116 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 3 with 57 rules applied. Total rules applied 230 place count 116 transition count 318
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 116 transition count 318
Applied a total of 232 rules in 33 ms. Remains 116 /177 variables (removed 61) and now considering 318/358 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 116/177 places, 318/358 transitions.
RANDOM walk for 4000000 steps (230810 resets) in 6954 ms. (575 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (54255 resets) in 1947 ms. (2053 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 482306 steps, run visited all 1 properties in 1185 ms. (steps per millisecond=407 )
Probabilistic random walk after 482306 steps, saw 173745 distinct states, run finished after 1189 ms. (steps per millisecond=405 ) properties seen :1
FORMULA FireWire-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 298 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 298 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 298 transition count 503
Applied a total of 87 rules in 8 ms. Remains 298 /341 variables (removed 43) and now considering 503/574 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 298/341 places, 503/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 297 transition count 503
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 297 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 297 transition count 502
Applied a total of 89 rules in 7 ms. Remains 297 /341 variables (removed 44) and now considering 502/574 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 297/341 places, 502/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 547
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 547
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 303 transition count 510
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 303 transition count 510
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 303 transition count 508
Applied a total of 78 rules in 8 ms. Remains 303 /341 variables (removed 38) and now considering 508/574 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 508 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 273 edges and 341 vertex of which 19 / 341 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 324 transition count 493
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 131 place count 261 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 133 place count 259 transition count 489
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 133 place count 259 transition count 469
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 173 place count 239 transition count 469
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 195 place count 217 transition count 444
Iterating global reduction 3 with 22 rules applied. Total rules applied 217 place count 217 transition count 444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 217 place count 217 transition count 436
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 233 place count 209 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 204 transition count 408
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 204 transition count 408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 247 place count 204 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 202 transition count 404
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 291 place count 181 transition count 383
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 179 transition count 361
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 179 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 179 transition count 360
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 179 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 177 transition count 358
Applied a total of 299 rules in 38 ms. Remains 177 /341 variables (removed 164) and now considering 358/574 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 265 edges and 341 vertex of which 15 / 341 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 328 transition count 500
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 267 transition count 498
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 266 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 265 transition count 497
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 128 place count 265 transition count 477
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 168 place count 245 transition count 477
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 189 place count 224 transition count 453
Iterating global reduction 4 with 21 rules applied. Total rules applied 210 place count 224 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 210 place count 224 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 224 place count 217 transition count 446
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 228 place count 213 transition count 438
Iterating global reduction 4 with 4 rules applied. Total rules applied 232 place count 213 transition count 438
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 236 place count 213 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 211 transition count 434
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 282 place count 189 transition count 412
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 284 place count 187 transition count 390
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 187 transition count 390
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 185 transition count 388
Applied a total of 288 rules in 33 ms. Remains 185 /341 variables (removed 156) and now considering 388/574 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 185/341 places, 388/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 312 transition count 542
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 312 transition count 542
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 300 transition count 525
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 300 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 523
Applied a total of 84 rules in 10 ms. Remains 300 /341 variables (removed 41) and now considering 523/574 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 300/341 places, 523/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 541
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 541
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 296 transition count 503
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 296 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 296 transition count 501
Applied a total of 92 rules in 8 ms. Remains 296 /341 variables (removed 45) and now considering 501/574 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 296/341 places, 501/574 transitions.
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:43:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:32] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 8 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:33] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 297 transition count 505
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 297 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 297 transition count 503
Applied a total of 90 rules in 7 ms. Remains 297 /341 variables (removed 44) and now considering 503/574 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 297/341 places, 503/574 transitions.
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:33] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 7 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:43:33] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:43:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:43:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 23:43:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 574 transitions and 1730 arcs took 4 ms.
Total runtime 172935 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 341
TRANSITIONS: 574
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.002s]


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


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

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

Process ID: 954
MODEL NAME: /home/mcc/execution/413/model
341 places, 574 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-17-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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