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

--------------------
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 1717357120057

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:38:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:38:41] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 19:38:41] [INFO ] Transformed 428 places.
[2024-06-02 19:38:41] [INFO ] Transformed 656 transitions.
[2024-06-02 19:38:41] [INFO ] Found NUPN structural information;
[2024-06-02 19:38:41] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 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 104 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 19:38:41] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 19:38:41] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-02 19:38:41] [INFO ] Invariant cache hit.
[2024-06-02 19:38:42] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 573 sub problems to find dead transitions.
[2024-06-02 19:38:42] [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 19:38:48] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 28 ms to minimize.
[2024-06-02 19:38:48] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:49] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:38:51] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:38:54] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:38: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 19:38:55] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:38:56] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:38:56] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:38:56] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:38:56] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:38:59] [INFO ] Deduced a trap composed of 167 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:38:59] [INFO ] Deduced a trap composed of 84 places in 54 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 19:39:03] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:39:03] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:39:04] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:39:04] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:39:04] [INFO ] Deduced a trap composed of 125 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:39:05] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
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 30039 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 19:39:24] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:39:26] [INFO ] Deduced a trap composed of 171 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 171 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:39:27] [INFO ] Deduced a trap composed of 160 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:39:29] [INFO ] Deduced a trap composed of 177 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:39:31] [INFO ] Deduced a trap composed of 167 places in 98 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 30030 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 60353ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 341/428 places, 574/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61075 ms. Remains : 341/428 places, 574/656 transitions.
Support contains 101 out of 341 places after structural reductions.
[2024-06-02 19:39:42] [INFO ] Flatten gal took : 72 ms
[2024-06-02 19:39:42] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:39: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 (14 resets) in 1650 ms. (24 steps per ms) remains 56/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 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 4004 steps (8 resets) in 29 ms. (133 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 4004 steps (8 resets) in 20 ms. (190 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 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 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 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
[2024-06-02 19:39:43] [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, 55 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, 53 unsolved
[2024-06-02 19:39:44] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:39:44] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 19:39:45] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:39:45] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:39:45] [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, 3/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/318 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 26/872 variables, 12/330 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 22/894 variables, 12/342 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/894 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 8/902 variables, 4/346 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/915 variables, and 346 constraints, problems are : Problem set: 2 solved, 53 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 334/341 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 231/306 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 19:39:49] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:39:49] [INFO ] Deduced a trap composed of 175 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:39:49] [INFO ] Deduced a trap composed of 170 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/15 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/321 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 52/373 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 19:39:51] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:39:52] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:39:52] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 3/376 constraints. Problems are: Problem set: 2 solved, 53 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 Int declared 846/915 variables, and 376 constraints, problems are : Problem set: 2 solved, 53 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/341 constraints, PredecessorRefiner: 52/55 constraints, Known Traps: 11/11 constraints]
After SMT, in 10063ms problems are : Problem set: 2 solved, 53 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 8 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 2 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 1 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 1 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 130 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 130 ms. Remains : 185/341 places, 502/574 transitions.
RANDOM walk for 40000 steps (1545 resets) in 746 ms. (53 steps per ms) remains 39/53 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (30 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (30 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (32 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (31 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (31 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (32 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (31 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
[2024-06-02 19:39:54] [INFO ] Flow matrix only has 488 transitions (discarded 14 similar events)
// Phase 1: matrix 488 rows 185 cols
[2024-06-02 19:39:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:39:54] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 124/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 54 places in 46 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, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 488/668 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 12/200 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 4 ms to minimize.
[2024-06-02 19:39:55] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:39:56] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:39:56] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 5/673 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/673 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 211 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 124/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 19:39:57] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:39:57] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 488/668 variables, 180/196 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 34/242 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 5/673 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 248 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4830 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 9/9 constraints]
After SMT, in 7481ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 1 properties in 31211 ms.
Support contains 55 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 502/502 transitions.
Graph (trivial) has 38 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 0 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 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 184 transition count 499
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 183 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 182 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 182 transition count 497
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 175 transition count 491
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 24 place count 175 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 32 place count 171 transition count 532
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 88 place count 171 transition count 476
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 171 transition count 472
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 96 place count 167 transition count 472
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 97 place count 167 transition count 472
Applied a total of 97 rules in 61 ms. Remains 167 /185 variables (removed 18) and now considering 472/502 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 167/185 places, 472/502 transitions.
RANDOM walk for 40000 steps (1352 resets) in 310 ms. (128 steps per ms) remains 23/34 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (33 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 11 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (27 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
[2024-06-02 19:40:33] [INFO ] Flow matrix only has 453 transitions (discarded 19 similar events)
// Phase 1: matrix 453 rows 167 cols
[2024-06-02 19:40:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:40:33] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 115/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 11/162 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 453/615 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 43/215 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 5/620 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/620 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 220 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 115/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 11/162 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 453/615 variables, 162/178 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 5/620 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/620 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/620 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 247 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 9/9 constraints]
After SMT, in 4074ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 9563 ms.
Support contains 36 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 167 transition count 469
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 164 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 163 transition count 468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 163 transition count 467
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 162 transition count 467
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 22 place count 156 transition count 461
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 153 transition count 478
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 153 transition count 466
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 153 transition count 463
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 49 place count 150 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 67 place count 150 transition count 442
Applied a total of 67 rules in 49 ms. Remains 150 /167 variables (removed 17) and now considering 442/472 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 150/167 places, 442/472 transitions.
RANDOM walk for 40000 steps (1603 resets) in 333 ms. (119 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (38 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (27 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (38 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (38 resets) in 31 ms. (125 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 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (39 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
[2024-06-02 19:40:47] [INFO ] Flow matrix only has 427 transitions (discarded 15 similar events)
// Phase 1: matrix 427 rows 150 cols
[2024-06-02 19:40:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:40:47] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 107/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:47] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:40:47] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 8/145 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 427/572 variables, 145/154 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 42/196 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 5/577 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/577 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/577 variables, and 202 constraints, problems are : Problem set: 0 solved, 18 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 107/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:40:48] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/145 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 427/572 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 42/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 17/219 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 5/577 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/577 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/577 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/577 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 226 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints]
After SMT, in 3298ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 1 properties in 2119 ms.
Support contains 29 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 442/442 transitions.
Graph (trivial) has 15 edges and 150 vertex of which 2 / 150 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 149 transition count 414
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 3 place count 148 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 5 place count 147 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 412
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 147 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 17 place count 146 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 26 place count 146 transition count 397
Applied a total of 26 rules in 30 ms. Remains 146 /150 variables (removed 4) and now considering 397/442 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 146/150 places, 397/442 transitions.
RANDOM walk for 40000 steps (1723 resets) in 306 ms. (130 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 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 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (45 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (38 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (23 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (40 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 340565 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :2 out of 17
Probabilistic random walk after 340565 steps, saw 104392 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :2
[2024-06-02 19:40:56] [INFO ] Flow matrix only has 357 transitions (discarded 40 similar events)
// Phase 1: matrix 357 rows 146 cols
[2024-06-02 19:40:56] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 19:40:56] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 108/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:56] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:40:56] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 8/141 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:56] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 357/498 variables, 141/151 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 49/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 5/503 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/503 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 205 constraints, problems are : Problem set: 0 solved, 15 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 108/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 8/141 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 357/498 variables, 141/156 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 49/205 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 14/219 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:57] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:40:58] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:40:58] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 5/503 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 228 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 11/11 constraints]
After SMT, in 2984ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 15722 ms.
Support contains 25 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 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 146 transition count 396
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 145 transition count 396
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 145 transition count 393
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 142 transition count 393
Applied a total of 8 rules in 26 ms. Remains 142 /146 variables (removed 4) and now considering 393/397 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 142/146 places, 393/397 transitions.
RANDOM walk for 40000 steps (1748 resets) in 233 ms. (170 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (45 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (45 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 329620 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :4 out of 15
Probabilistic random walk after 329620 steps, saw 102897 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :4
[2024-06-02 19:41:18] [INFO ] Flow matrix only has 353 transitions (discarded 40 similar events)
// Phase 1: matrix 353 rows 142 cols
[2024-06-02 19:41:18] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:41:18] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 104/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13/137 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:41:18] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:41:18] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 353/490 variables, 137/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 5/495 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/495 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 200 constraints, problems are : Problem set: 0 solved, 11 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 104/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:41:18] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:41:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:41:19] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:41:19] [INFO ] Deduced a trap composed of 51 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:41:19] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 13/137 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:41:19] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 353/490 variables, 137/152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 49/201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 5/495 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:41:19] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 218 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1653 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 9/9 constraints]
After SMT, in 2268ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 29040 ms.
Support contains 20 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 393/393 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 142 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 141 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 140 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 140 transition count 391
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 2 with 4 rules applied. Total rules applied 8 place count 138 transition count 389
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 138 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 137 transition count 388
Applied a total of 10 rules in 18 ms. Remains 137 /142 variables (removed 5) and now considering 388/393 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 137/142 places, 388/393 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:41:49] [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 14 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 14 ms. Remains : 304/341 places, 511/574 transitions.
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:41:49] [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 13 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 13 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:41:49] [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 14 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 15 ms. Remains : 300/341 places, 506/574 transitions.
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:41:49] [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 13 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 14 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:41:49] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:41:50] [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 19:41:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:41:50] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:41:50] [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 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
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 68 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 68 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 19:41:50] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:41:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:41:50] [INFO ] Input system was already deterministic with 358 transitions.
RANDOM walk for 40000 steps (2238 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (467 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1842376 steps, run timeout after 3001 ms. (steps per millisecond=613 ) properties seen :0 out of 1
Probabilistic random walk after 1842376 steps, saw 388494 distinct states, run finished after 3001 ms. (steps per millisecond=613 ) properties seen :0
[2024-06-02 19:41:53] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 177 cols
[2024-06-02 19:41:53] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 19:41:53] [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 191 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 233 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 442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 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 1 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 36 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 36 ms. Remains : 116/177 places, 318/358 transitions.
RANDOM walk for 4000000 steps (230750 resets) in 6519 ms. (613 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (54203 resets) in 2084 ms. (1918 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 482306 steps, run visited all 1 properties in 1048 ms. (steps per millisecond=460 )
Probabilistic random walk after 482306 steps, saw 173745 distinct states, run finished after 1052 ms. (steps per millisecond=458 ) 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 9 ms. Remains : 298/341 places, 503/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [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 8 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 8 ms. Remains : 297/341 places, 502/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:41:57] [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 11 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 11 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:41:57] [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 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 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 43 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 44 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:41:57] [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 0 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 1 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 0 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 38 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 38 ms. Remains : 185/341 places, 388/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:41:57] [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 9 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 9 ms. Remains : 300/341 places, 523/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:41:57] [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 9 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 9 ms. Remains : 296/341 places, 501/574 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:41:57] [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 19:41:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [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 8 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 19:41:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:41:57] [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 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 19:41:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:41:57] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:41:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 19:41:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 574 transitions and 1730 arcs took 3 ms.
Total runtime 196805 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-14
Could not compute solution for formula : FireWire-PT-17-CTLFireability-2024-15

BK_STOP 1717357318375

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r553-tall-171734901300298"
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 ;