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.r468-smll-171620167400305.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 AutonomousCar-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 228K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717213435656

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:43:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:43:58] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-06-01 03:43:58] [INFO ] Transformed 289 places.
[2024-06-01 03:43:58] [INFO ] Transformed 644 transitions.
[2024-06-01 03:43:58] [INFO ] Found NUPN structural information;
[2024-06-01 03:43:58] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 526 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
Support contains 118 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 624
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 624
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 267 transition count 622
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 267 transition count 622
Applied a total of 44 rules in 147 ms. Remains 267 /289 variables (removed 22) and now considering 622/644 (removed 22) transitions.
// Phase 1: matrix 622 rows 267 cols
[2024-06-01 03:43:59] [INFO ] Computed 11 invariants in 47 ms
[2024-06-01 03:43:59] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 03:43:59] [INFO ] Invariant cache hit.
[2024-06-01 03:44:00] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-01 03:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 03:44:15] [INFO ] Deduced a trap composed of 55 places in 501 ms of which 59 ms to minimize.
[2024-06-01 03:44:16] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 5 ms to minimize.
[2024-06-01 03:44:16] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 6 ms to minimize.
[2024-06-01 03:44:16] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 4 ms to minimize.
[2024-06-01 03:44:17] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 3 ms to minimize.
[2024-06-01 03:44:17] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 4 ms to minimize.
[2024-06-01 03:44:17] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 03:44:17] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-06-01 03:44:18] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 2 ms to minimize.
[2024-06-01 03:44:18] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-06-01 03:44:18] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 3 ms to minimize.
[2024-06-01 03:44:19] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 4 ms to minimize.
[2024-06-01 03:44:19] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-06-01 03:44:19] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 3 ms to minimize.
[2024-06-01 03:44:20] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 4 ms to minimize.
[2024-06-01 03:44:20] [INFO ] Deduced a trap composed of 53 places in 360 ms of which 3 ms to minimize.
[2024-06-01 03:44:20] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 2 ms to minimize.
[2024-06-01 03:44:21] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 4 ms to minimize.
[2024-06-01 03:44:21] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 4 ms to minimize.
[2024-06-01 03:44:22] [INFO ] Deduced a trap composed of 43 places in 407 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 03:44:23] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 3 ms to minimize.
[2024-06-01 03:44:23] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2024-06-01 03:44:23] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-06-01 03:44:24] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 4 ms to minimize.
[2024-06-01 03:44:24] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 4 ms to minimize.
[2024-06-01 03:44:24] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-06-01 03:44:24] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 3 ms to minimize.
[2024-06-01 03:44:25] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 3 ms to minimize.
[2024-06-01 03:44:25] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 3 ms to minimize.
[2024-06-01 03:44:26] [INFO ] Deduced a trap composed of 37 places in 376 ms of which 4 ms to minimize.
[2024-06-01 03:44:26] [INFO ] Deduced a trap composed of 45 places in 355 ms of which 4 ms to minimize.
[2024-06-01 03:44:27] [INFO ] Deduced a trap composed of 42 places in 351 ms of which 4 ms to minimize.
[2024-06-01 03:44:27] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 4 ms to minimize.
[2024-06-01 03:44:27] [INFO ] Deduced a trap composed of 28 places in 334 ms of which 4 ms to minimize.
[2024-06-01 03:44:28] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 5 ms to minimize.
[2024-06-01 03:44:28] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 3 ms to minimize.
[2024-06-01 03:44:28] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2024-06-01 03:44:29] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-06-01 03:44:29] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-06-01 03:44:29] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/889 variables, and 51 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 03:44:40] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 3 ms to minimize.
[2024-06-01 03:44:40] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 4 ms to minimize.
[2024-06-01 03:44:40] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-01 03:44:41] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 4 ms to minimize.
[2024-06-01 03:44:41] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-01 03:44:42] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 5 ms to minimize.
[2024-06-01 03:44:42] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-06-01 03:44:43] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 4 ms to minimize.
[2024-06-01 03:44:43] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 4 ms to minimize.
[2024-06-01 03:44:43] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 3 ms to minimize.
[2024-06-01 03:44:43] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 4 ms to minimize.
[2024-06-01 03:44:44] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-06-01 03:44:45] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:44:45] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 2 ms to minimize.
[2024-06-01 03:44:46] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-06-01 03:44:46] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 2 ms to minimize.
[2024-06-01 03:44:46] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:44:47] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 5 ms to minimize.
[2024-06-01 03:44:48] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 4 ms to minimize.
[2024-06-01 03:44:48] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 03:44:52] [INFO ] Deduced a trap composed of 25 places in 373 ms of which 4 ms to minimize.
[2024-06-01 03:44:53] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 3 ms to minimize.
[2024-06-01 03:44:53] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 03:45:00] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-06-01 03:45:01] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-06-01 03:45:01] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 3 ms to minimize.
[2024-06-01 03:45:02] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 3 ms to minimize.
[2024-06-01 03:45:02] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 4 ms to minimize.
[2024-06-01 03:45:03] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2024-06-01 03:45:03] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2024-06-01 03:45:03] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/889 variables, and 82 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 0/621 constraints, Known Traps: 71/71 constraints]
After SMT, in 63723ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 63784ms
Starting structural reductions in LTL mode, iteration 1 : 267/289 places, 622/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65490 ms. Remains : 267/289 places, 622/644 transitions.
Support contains 118 out of 267 places after structural reductions.
[2024-06-01 03:45:04] [INFO ] Flatten gal took : 220 ms
[2024-06-01 03:45:04] [INFO ] Flatten gal took : 120 ms
[2024-06-01 03:45:05] [INFO ] Input system was already deterministic with 622 transitions.
Support contains 105 out of 267 places (down from 118) after GAL structural reductions.
FORMULA AutonomousCar-PT-06b-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (151 resets) in 2954 ms. (13 steps per ms) remains 18/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
[2024-06-01 03:45:06] [INFO ] Invariant cache hit.
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, 16 unsolved
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 227/257 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 10/267 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 622/889 variables, 267/278 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/889 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 889/889 variables, and 278 constraints, problems are : Problem set: 1 solved, 15 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 229/257 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 03:45:08] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 5 ms to minimize.
[2024-06-01 03:45:08] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 4 ms to minimize.
[2024-06-01 03:45:08] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 3 ms to minimize.
[2024-06-01 03:45:08] [INFO ] Deduced a trap composed of 42 places in 351 ms of which 3 ms to minimize.
[2024-06-01 03:45:09] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 4 ms to minimize.
[2024-06-01 03:45:09] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-06-01 03:45:09] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 3 ms to minimize.
[2024-06-01 03:45:09] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-06-01 03:45:10] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 3 ms to minimize.
[2024-06-01 03:45:10] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 4 ms to minimize.
[2024-06-01 03:45:10] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
[2024-06-01 03:45:10] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2024-06-01 03:45:11] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 3 ms to minimize.
[2024-06-01 03:45:11] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-06-01 03:45:11] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 4 ms to minimize.
[2024-06-01 03:45:12] [INFO ] Deduced a trap composed of 44 places in 373 ms of which 4 ms to minimize.
[2024-06-01 03:45:12] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 4 ms to minimize.
SMT process timed out in 5998ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 211 edges and 267 vertex of which 2 / 267 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 938 edges and 266 vertex of which 265 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 265 transition count 530
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 112 rules applied. Total rules applied 204 place count 176 transition count 507
Reduce places removed 13 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 22 rules applied. Total rules applied 226 place count 163 transition count 498
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 235 place count 154 transition count 498
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 235 place count 154 transition count 491
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 147 transition count 491
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 261 place count 135 transition count 479
Iterating global reduction 4 with 12 rules applied. Total rules applied 273 place count 135 transition count 479
Ensure Unique test 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 4 with 3 rules applied. Total rules applied 276 place count 135 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 134 transition count 476
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 281 place count 130 transition count 439
Iterating global reduction 6 with 4 rules applied. Total rules applied 285 place count 130 transition count 439
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 6 with 4 rules applied. Total rules applied 289 place count 130 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 291 place count 128 transition count 435
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 357 place count 95 transition count 402
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 363 place count 89 transition count 327
Iterating global reduction 8 with 6 rules applied. Total rules applied 369 place count 89 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 370 place count 89 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 9 with 92 rules applied. Total rules applied 462 place count 89 transition count 234
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 472 place count 89 transition count 224
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 482 place count 79 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 485 place count 79 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 486 place count 78 transition count 220
Applied a total of 486 rules in 336 ms. Remains 78 /267 variables (removed 189) and now considering 220/622 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 78/267 places, 220/622 transitions.
RANDOM walk for 40000 steps (154 resets) in 657 ms. (60 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40000 steps (15 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (279 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
// Phase 1: matrix 220 rows 78 cols
[2024-06-01 03:45:13] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/282 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/291 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/298 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/298 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/282 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/291 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/298 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/298 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 654 ms.
Support contains 9 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 220/220 transitions.
Graph (trivial) has 44 edges and 78 vertex of which 2 / 78 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 510 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 76 transition count 211
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 10 rules applied. Total rules applied 19 place count 69 transition count 208
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 67 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 66 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 23 place count 66 transition count 203
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 31 place count 62 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 61 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 61 transition count 202
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 41 place count 57 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 57 transition count 197
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 45 place count 57 transition count 194
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 48 place count 54 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 54 transition count 193
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 54 transition count 193
Applied a total of 51 rules in 58 ms. Remains 54 /78 variables (removed 24) and now considering 193/220 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 54/78 places, 193/220 transitions.
RANDOM walk for 40000 steps (501 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (331 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 839675 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 2
Probabilistic random walk after 839675 steps, saw 128582 distinct states, run finished after 3008 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 193 rows 54 cols
[2024-06-01 03:45:17] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 03:45:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/241 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/242 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/247 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/241 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/247 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/247 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 67 constraints, problems are : Problem set: 0 solved, 2 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1486 ms.
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 193/193 transitions.
Applied a total of 0 rules in 14 ms. Remains 54 /54 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 54/54 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 193/193 transitions.
Applied a total of 0 rules in 12 ms. Remains 54 /54 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-01 03:45:20] [INFO ] Invariant cache hit.
[2024-06-01 03:45:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 03:45:20] [INFO ] Invariant cache hit.
[2024-06-01 03:45:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:45:20] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [48, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 332 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/54 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 192
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 192
Applied a total of 3 rules in 19 ms. Remains 51 /52 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 51 cols
[2024-06-01 03:45:20] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:45:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 03:45:20] [INFO ] Invariant cache hit.
[2024-06-01 03:45:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:45:20] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 51/54 places, 192/193 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 644 ms. Remains : 51/54 places, 192/193 transitions.
RANDOM walk for 40000 steps (541 resets) in 1944 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (342 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1172445 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 2
Probabilistic random walk after 1172445 steps, saw 179280 distinct states, run finished after 3002 ms. (steps per millisecond=390 ) properties seen :0
[2024-06-01 03:45:24] [INFO ] Invariant cache hit.
[2024-06-01 03:45:24] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/240 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/243 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/240 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/243 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 64 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 678 ms.
Support contains 9 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 192/192 transitions.
Applied a total of 0 rules in 22 ms. Remains 51 /51 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 51/51 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-01 03:45:25] [INFO ] Invariant cache hit.
[2024-06-01 03:45:25] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 03:45:25] [INFO ] Invariant cache hit.
[2024-06-01 03:45:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:45:25] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 03:45:25] [INFO ] Redundant transitions in 9 ms returned []
Running 191 sub problems to find dead transitions.
[2024-06-01 03:45:25] [INFO ] Invariant cache hit.
[2024-06-01 03:45:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-01 03:45:27] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 5 (OVERLAPS) 192/243 variables, 51/66 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 189 unsolved
[2024-06-01 03:45:30] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 69 constraints, problems are : Problem set: 2 solved, 189 unsolved in 8343 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 192/243 variables, 51/67 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/69 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 189/258 constraints. Problems are: Problem set: 2 solved, 189 unsolved
[2024-06-01 03:45:39] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 03:45:39] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 2/260 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 189 unsolved
[2024-06-01 03:45:47] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-06-01 03:45:47] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/243 variables, 2/262 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 189 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 262 constraints, problems are : Problem set: 2 solved, 189 unsolved in 24079 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 189/191 constraints, Known Traps: 11/11 constraints]
After SMT, in 32933ms problems are : Problem set: 2 solved, 189 unsolved
Search for dead transitions found 2 dead transitions in 32936ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/51 places, 190/192 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 51 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 49 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 188
Applied a total of 4 rules in 9 ms. Remains 49 /51 variables (removed 2) and now considering 188/190 (removed 2) transitions.
// Phase 1: matrix 188 rows 49 cols
[2024-06-01 03:45:58] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 03:45:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 03:45:58] [INFO ] Invariant cache hit.
[2024-06-01 03:45:58] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/51 places, 188/192 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33451 ms. Remains : 49/51 places, 188/192 transitions.
RANDOM walk for 40000 steps (498 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (337 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1218969 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 2
Probabilistic random walk after 1218969 steps, saw 182128 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
[2024-06-01 03:46:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/237 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 58 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/225 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/237 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 60 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 509 ms.
Support contains 9 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 49/49 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-01 03:46:03] [INFO ] Invariant cache hit.
[2024-06-01 03:46:03] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 03:46:03] [INFO ] Invariant cache hit.
[2024-06-01 03:46:03] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-01 03:46:03] [INFO ] Redundant transitions in 12 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-01 03:46:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 03:46:05] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2024-06-01 03:46:05] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2024-06-01 03:46:06] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 03:46:06] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-06-01 03:46:06] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
[2024-06-01 03:46:06] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/237 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 03:46:08] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 65 constraints, problems are : Problem set: 0 solved, 187 unsolved in 8599 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/237 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 187/252 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 03:46:17] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 03:46:17] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-01 03:46:17] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 255 constraints, problems are : Problem set: 0 solved, 187 unsolved in 19183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
After SMT, in 28517ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 28522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28878 ms. Remains : 49/49 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 03:46:31] [INFO ] Invariant cache hit.
[2024-06-01 03:46:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 03:46:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-01 03:46:32] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 03:46:32] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 03:46:32] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 322 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 52 ms
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 51 ms
[2024-06-01 03:46:32] [INFO ] Input system was already deterministic with 622 transitions.
Computed a total of 50 stabilizing places and 51 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 252 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 264 transition count 509
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 143 rules applied. Total rules applied 254 place count 154 transition count 476
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 274 place count 135 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 134 transition count 475
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 275 place count 134 transition count 467
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 291 place count 126 transition count 467
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 306 place count 111 transition count 452
Iterating global reduction 4 with 15 rules applied. Total rules applied 321 place count 111 transition count 452
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 465 place count 111 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 465 place count 111 transition count 307
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 467 place count 110 transition count 307
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 471 place count 106 transition count 288
Iterating global reduction 5 with 4 rules applied. Total rules applied 475 place count 106 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 6 rules applied. Total rules applied 481 place count 106 transition count 282
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 484 place count 103 transition count 282
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 552 place count 69 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 553 place count 69 transition count 247
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 562 place count 60 transition count 187
Iterating global reduction 8 with 9 rules applied. Total rules applied 571 place count 60 transition count 187
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 8 with 4 rules applied. Total rules applied 575 place count 60 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 577 place count 58 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 579 place count 57 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 581 place count 57 transition count 180
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 10 with 1 rules applied. Total rules applied 582 place count 57 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 583 place count 56 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 585 place count 54 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 586 place count 53 transition count 177
Applied a total of 586 rules in 139 ms. Remains 53 /267 variables (removed 214) and now considering 177/622 (removed 445) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 53/267 places, 177/622 transitions.
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 25 ms
[2024-06-01 03:46:32] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 240 transition count 595
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 240 transition count 595
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 202 place count 236 transition count 447
Iterating global reduction 1 with 4 rules applied. Total rules applied 206 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 235 transition count 446
Applied a total of 208 rules in 28 ms. Remains 235 /267 variables (removed 32) and now considering 446/622 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 235/267 places, 446/622 transitions.
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 33 ms
[2024-06-01 03:46:32] [INFO ] Flatten gal took : 34 ms
[2024-06-01 03:46:33] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 241 transition count 596
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 200 place count 237 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 204 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 236 transition count 447
Applied a total of 206 rules in 25 ms. Remains 236 /267 variables (removed 31) and now considering 447/622 (removed 175) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 236/267 places, 447/622 transitions.
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:46:33] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 250 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 264 transition count 510
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 142 rules applied. Total rules applied 252 place count 155 transition count 477
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 274 place count 136 transition count 474
Reduce places removed 3 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 5 rules applied. Total rules applied 279 place count 133 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 132 transition count 472
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 280 place count 132 transition count 466
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 292 place count 126 transition count 466
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 307 place count 111 transition count 451
Iterating global reduction 5 with 15 rules applied. Total rules applied 322 place count 111 transition count 451
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 466 place count 111 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 466 place count 111 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 468 place count 110 transition count 306
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 472 place count 106 transition count 287
Iterating global reduction 6 with 4 rules applied. Total rules applied 476 place count 106 transition count 287
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 6 with 4 rules applied. Total rules applied 480 place count 106 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 482 place count 104 transition count 283
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 550 place count 70 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 551 place count 70 transition count 248
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 560 place count 61 transition count 188
Iterating global reduction 9 with 9 rules applied. Total rules applied 569 place count 61 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 9 with 6 rules applied. Total rules applied 575 place count 61 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 578 place count 58 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 580 place count 57 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 581 place count 57 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 583 place count 55 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 584 place count 54 transition count 178
Applied a total of 584 rules in 101 ms. Remains 54 /267 variables (removed 213) and now considering 178/622 (removed 444) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 54/267 places, 178/622 transitions.
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:46:33] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 248 transition count 603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 248 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 245 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 245 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 244 transition count 599
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 244 transition count 599
Applied a total of 46 rules in 23 ms. Remains 244 /267 variables (removed 23) and now considering 599/622 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 244/267 places, 599/622 transitions.
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 48 ms
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 59 ms
[2024-06-01 03:46:33] [INFO ] Input system was already deterministic with 599 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 244 transition count 599
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 190 place count 244 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 194 place count 240 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 239 transition count 450
Applied a total of 200 rules in 37 ms. Remains 239 /267 variables (removed 28) and now considering 450/622 (removed 172) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 239/267 places, 450/622 transitions.
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 41 ms
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 42 ms
[2024-06-01 03:46:33] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 244 transition count 599
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 190 place count 244 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 241 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 240 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 240 transition count 451
Applied a total of 198 rules in 23 ms. Remains 240 /267 variables (removed 27) and now considering 451/622 (removed 171) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 240/267 places, 451/622 transitions.
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:46:33] [INFO ] Flatten gal took : 25 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 451 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 245 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 264 transition count 515
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 132 rules applied. Total rules applied 237 place count 160 transition count 487
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 254 place count 144 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 143 transition count 486
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 255 place count 143 transition count 475
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 277 place count 132 transition count 475
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 291 place count 118 transition count 461
Iterating global reduction 4 with 14 rules applied. Total rules applied 305 place count 118 transition count 461
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 449 place count 118 transition count 317
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 452 place count 115 transition count 299
Iterating global reduction 5 with 3 rules applied. Total rules applied 455 place count 115 transition count 299
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 5 with 2 rules applied. Total rules applied 457 place count 115 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 458 place count 114 transition count 297
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 7 with 70 rules applied. Total rules applied 528 place count 79 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 529 place count 79 transition count 261
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 537 place count 71 transition count 207
Iterating global reduction 8 with 8 rules applied. Total rules applied 545 place count 71 transition count 207
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 8 with 4 rules applied. Total rules applied 549 place count 71 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 551 place count 69 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 553 place count 68 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 556 place count 68 transition count 199
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 10 with 1 rules applied. Total rules applied 557 place count 68 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 558 place count 67 transition count 198
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 559 place count 67 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 561 place count 65 transition count 196
Applied a total of 561 rules in 62 ms. Remains 65 /267 variables (removed 202) and now considering 196/622 (removed 426) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 65/267 places, 196/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 241 transition count 596
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 196 place count 241 transition count 452
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 200 place count 237 transition count 448
Iterating global reduction 1 with 4 rules applied. Total rules applied 204 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 236 transition count 447
Applied a total of 206 rules in 20 ms. Remains 236 /267 variables (removed 31) and now considering 447/622 (removed 175) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 236/267 places, 447/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 253 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 264 transition count 506
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 146 rules applied. Total rules applied 260 place count 151 transition count 473
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 279 place count 132 transition count 473
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 279 place count 132 transition count 465
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 295 place count 124 transition count 465
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 310 place count 109 transition count 450
Iterating global reduction 3 with 15 rules applied. Total rules applied 325 place count 109 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 469 place count 109 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 469 place count 109 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 471 place count 108 transition count 305
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 475 place count 104 transition count 286
Iterating global reduction 4 with 4 rules applied. Total rules applied 479 place count 104 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 6 rules applied. Total rules applied 485 place count 104 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 488 place count 101 transition count 280
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 556 place count 67 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 557 place count 67 transition count 245
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 566 place count 58 transition count 185
Iterating global reduction 7 with 9 rules applied. Total rules applied 575 place count 58 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 with 6 rules applied. Total rules applied 581 place count 58 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 584 place count 55 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 586 place count 54 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 587 place count 54 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 588 place count 54 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 590 place count 52 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 591 place count 51 transition count 175
Applied a total of 591 rules in 61 ms. Remains 51 /267 variables (removed 216) and now considering 175/622 (removed 447) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 51/267 places, 175/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 246 transition count 601
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 246 transition count 601
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 186 place count 246 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 243 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 243 transition count 454
Applied a total of 192 rules in 19 ms. Remains 243 /267 variables (removed 24) and now considering 454/622 (removed 168) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 243/267 places, 454/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 22 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 454 transitions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 243 transition count 598
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 243 transition count 598
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 192 place count 243 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 240 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 239 transition count 450
Applied a total of 200 rules in 21 ms. Remains 239 /267 variables (removed 28) and now considering 450/622 (removed 172) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 239/267 places, 450/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 248 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 264 transition count 508
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 144 rules applied. Total rules applied 256 place count 153 transition count 475
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 276 place count 134 transition count 474
Reduce places removed 1 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 3 rules applied. Total rules applied 279 place count 133 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 132 transition count 472
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 280 place count 132 transition count 465
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 294 place count 125 transition count 465
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 309 place count 110 transition count 450
Iterating global reduction 5 with 15 rules applied. Total rules applied 324 place count 110 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 468 place count 110 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 468 place count 110 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 470 place count 109 transition count 305
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 474 place count 105 transition count 286
Iterating global reduction 6 with 4 rules applied. Total rules applied 478 place count 105 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 6 rules applied. Total rules applied 484 place count 105 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 487 place count 102 transition count 280
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 553 place count 69 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 554 place count 69 transition count 246
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 561 place count 62 transition count 200
Iterating global reduction 9 with 7 rules applied. Total rules applied 568 place count 62 transition count 200
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 9 with 4 rules applied. Total rules applied 572 place count 62 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 574 place count 60 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 576 place count 59 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 577 place count 59 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 579 place count 57 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 580 place count 56 transition count 192
Applied a total of 580 rules in 52 ms. Remains 56 /267 variables (removed 211) and now considering 192/622 (removed 430) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 56/267 places, 192/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:46:34] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 250 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 264 transition count 510
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 143 rules applied. Total rules applied 253 place count 155 transition count 476
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 275 place count 135 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 277 place count 133 transition count 474
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 277 place count 133 transition count 467
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 291 place count 126 transition count 467
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 306 place count 111 transition count 452
Iterating global reduction 4 with 15 rules applied. Total rules applied 321 place count 111 transition count 452
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 4 with 145 rules applied. Total rules applied 466 place count 111 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 466 place count 111 transition count 306
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 468 place count 110 transition count 306
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 472 place count 106 transition count 287
Iterating global reduction 5 with 4 rules applied. Total rules applied 476 place count 106 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 6 rules applied. Total rules applied 482 place count 106 transition count 281
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 485 place count 103 transition count 281
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 553 place count 69 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 554 place count 69 transition count 246
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 563 place count 60 transition count 186
Iterating global reduction 8 with 9 rules applied. Total rules applied 572 place count 60 transition count 186
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 8 with 4 rules applied. Total rules applied 576 place count 60 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 578 place count 58 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 580 place count 57 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 581 place count 57 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 583 place count 55 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 584 place count 54 transition count 178
Applied a total of 584 rules in 48 ms. Remains 54 /267 variables (removed 213) and now considering 178/622 (removed 444) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 54/267 places, 178/622 transitions.
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:46:34] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:46:35] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 267/267 places, 622/622 transitions.
Graph (trivial) has 229 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 265 transition count 523
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 123 rules applied. Total rules applied 221 place count 168 transition count 497
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 240 place count 154 transition count 492
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 245 place count 149 transition count 492
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 245 place count 149 transition count 480
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 269 place count 137 transition count 480
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 285 place count 121 transition count 464
Iterating global reduction 4 with 16 rules applied. Total rules applied 301 place count 121 transition count 464
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 445 place count 121 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 445 place count 121 transition count 319
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 447 place count 120 transition count 319
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 451 place count 116 transition count 300
Iterating global reduction 5 with 4 rules applied. Total rules applied 455 place count 116 transition count 300
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 5 with 2 rules applied. Total rules applied 457 place count 116 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 458 place count 115 transition count 298
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 522 place count 83 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 523 place count 83 transition count 265
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 532 place count 74 transition count 205
Iterating global reduction 8 with 9 rules applied. Total rules applied 541 place count 74 transition count 205
Ensure Unique test 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 8 with 3 rules applied. Total rules applied 544 place count 74 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 545 place count 73 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 547 place count 72 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 548 place count 72 transition count 200
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 551 place count 72 transition count 200
Applied a total of 551 rules in 49 ms. Remains 72 /267 variables (removed 195) and now considering 200/622 (removed 422) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 72/267 places, 200/622 transitions.
[2024-06-01 03:46:35] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:46:35] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:46:35] [INFO ] Input system was already deterministic with 200 transitions.
[2024-06-01 03:46:35] [INFO ] Flatten gal took : 31 ms
[2024-06-01 03:46:35] [INFO ] Flatten gal took : 32 ms
[2024-06-01 03:46:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 03:46:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 267 places, 622 transitions and 3768 arcs took 8 ms.
Total runtime 157368 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 : AutonomousCar-PT-06b-CTLCardinality-2024-00
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-01
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-02
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-03
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-04
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-06
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-07
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-08
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-09
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-10
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2024-11
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2023-12
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2023-13
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2023-14
Could not compute solution for formula : AutonomousCar-PT-06b-CTLCardinality-2023-15

BK_STOP 1717213595796

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/955/ctl_0_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/955/ctl_1_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/955/ctl_2_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/955/ctl_3_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/955/ctl_4_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/955/ctl_5_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/955/ctl_6_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/955/ctl_7_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/955/ctl_8_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/955/ctl_9_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/955/ctl_10_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/955/ctl_11_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/955/ctl_12_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/955/ctl_13_
ctl formula name AutonomousCar-PT-06b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/955/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="AutonomousCar-PT-06b"
export BK_EXAMINATION="CTLCardinality"
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 AutonomousCar-PT-06b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167400305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;