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.r464-smll-171620118300346.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 Anderson-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118300346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-08-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-08-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-08-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-08-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717256889345

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:48:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:48:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:48:11] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-06-01 15:48:11] [INFO ] Transformed 401 places.
[2024-06-01 15:48:11] [INFO ] Transformed 1328 transitions.
[2024-06-01 15:48:11] [INFO ] Found NUPN structural information;
[2024-06-01 15:48:11] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 465 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 106 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 348 transition count 1135
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 348 transition count 1135
Applied a total of 106 rules in 134 ms. Remains 348 /401 variables (removed 53) and now considering 1135/1328 (removed 193) transitions.
// Phase 1: matrix 1135 rows 348 cols
[2024-06-01 15:48:12] [INFO ] Computed 19 invariants in 81 ms
[2024-06-01 15:48:12] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-06-01 15:48:12] [INFO ] Invariant cache hit.
[2024-06-01 15:48:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 15:48:14] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-06-01 15:48:14] [INFO ] Invariant cache hit.
[2024-06-01 15:48:14] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 15:48:27] [INFO ] Deduced a trap composed of 138 places in 483 ms of which 40 ms to minimize.
[2024-06-01 15:48:27] [INFO ] Deduced a trap composed of 157 places in 391 ms of which 5 ms to minimize.
[2024-06-01 15:48:28] [INFO ] Deduced a trap composed of 126 places in 334 ms of which 10 ms to minimize.
[2024-06-01 15:48:28] [INFO ] Deduced a trap composed of 130 places in 365 ms of which 3 ms to minimize.
[2024-06-01 15:48:29] [INFO ] Deduced a trap composed of 218 places in 391 ms of which 4 ms to minimize.
[2024-06-01 15:48:29] [INFO ] Deduced a trap composed of 214 places in 417 ms of which 4 ms to minimize.
[2024-06-01 15:48:29] [INFO ] Deduced a trap composed of 155 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:48:30] [INFO ] Deduced a trap composed of 191 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:48:30] [INFO ] Deduced a trap composed of 207 places in 382 ms of which 3 ms to minimize.
[2024-06-01 15:48:31] [INFO ] Deduced a trap composed of 148 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:48:31] [INFO ] Deduced a trap composed of 143 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:48:31] [INFO ] Deduced a trap composed of 157 places in 369 ms of which 5 ms to minimize.
[2024-06-01 15:48:32] [INFO ] Deduced a trap composed of 155 places in 388 ms of which 4 ms to minimize.
[2024-06-01 15:48:32] [INFO ] Deduced a trap composed of 143 places in 379 ms of which 4 ms to minimize.
[2024-06-01 15:48:32] [INFO ] Deduced a trap composed of 144 places in 356 ms of which 3 ms to minimize.
[2024-06-01 15:48:33] [INFO ] Deduced a trap composed of 162 places in 385 ms of which 4 ms to minimize.
[2024-06-01 15:48:33] [INFO ] Deduced a trap composed of 117 places in 407 ms of which 3 ms to minimize.
[2024-06-01 15:48:34] [INFO ] Deduced a trap composed of 138 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:48:34] [INFO ] Deduced a trap composed of 171 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:48:35] [INFO ] Deduced a trap composed of 171 places in 377 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 15:48:36] [INFO ] Deduced a trap composed of 102 places in 409 ms of which 4 ms to minimize.
[2024-06-01 15:48:37] [INFO ] Deduced a trap composed of 84 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:48:37] [INFO ] Deduced a trap composed of 241 places in 416 ms of which 4 ms to minimize.
[2024-06-01 15:48:37] [INFO ] Deduced a trap composed of 174 places in 357 ms of which 4 ms to minimize.
[2024-06-01 15:48:38] [INFO ] Deduced a trap composed of 74 places in 401 ms of which 4 ms to minimize.
[2024-06-01 15:48:38] [INFO ] Deduced a trap composed of 74 places in 355 ms of which 4 ms to minimize.
[2024-06-01 15:48:39] [INFO ] Deduced a trap composed of 147 places in 339 ms of which 3 ms to minimize.
[2024-06-01 15:48:39] [INFO ] Deduced a trap composed of 145 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:48:39] [INFO ] Deduced a trap composed of 109 places in 347 ms of which 4 ms to minimize.
[2024-06-01 15:48:40] [INFO ] Deduced a trap composed of 103 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:48:40] [INFO ] Deduced a trap composed of 111 places in 364 ms of which 4 ms to minimize.
[2024-06-01 15:48:40] [INFO ] Deduced a trap composed of 119 places in 351 ms of which 3 ms to minimize.
[2024-06-01 15:48:41] [INFO ] Deduced a trap composed of 147 places in 395 ms of which 3 ms to minimize.
[2024-06-01 15:48:41] [INFO ] Deduced a trap composed of 90 places in 385 ms of which 6 ms to minimize.
[2024-06-01 15:48:42] [INFO ] Deduced a trap composed of 154 places in 403 ms of which 6 ms to minimize.
[2024-06-01 15:48:42] [INFO ] Deduced a trap composed of 151 places in 413 ms of which 3 ms to minimize.
[2024-06-01 15:48:42] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 4 ms to minimize.
[2024-06-01 15:48:43] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 3 ms to minimize.
[2024-06-01 15:48:43] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 4 ms to minimize.
[2024-06-01 15:48:44] [INFO ] Deduced a trap composed of 124 places in 420 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/1483 variables, and 59 constraints, problems are : Problem set: 0 solved, 1127 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/348 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1127/1127 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 15:48:51] [INFO ] Deduced a trap composed of 117 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:48:52] [INFO ] Deduced a trap composed of 195 places in 403 ms of which 4 ms to minimize.
[2024-06-01 15:48:52] [INFO ] Deduced a trap composed of 136 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:48:52] [INFO ] Deduced a trap composed of 164 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:48:53] [INFO ] Deduced a trap composed of 175 places in 407 ms of which 4 ms to minimize.
[2024-06-01 15:48:53] [INFO ] Deduced a trap composed of 164 places in 379 ms of which 4 ms to minimize.
[2024-06-01 15:48:54] [INFO ] Deduced a trap composed of 160 places in 386 ms of which 4 ms to minimize.
[2024-06-01 15:48:54] [INFO ] Deduced a trap composed of 138 places in 324 ms of which 3 ms to minimize.
[2024-06-01 15:48:54] [INFO ] Deduced a trap composed of 163 places in 377 ms of which 3 ms to minimize.
[2024-06-01 15:48:55] [INFO ] Deduced a trap composed of 159 places in 379 ms of which 3 ms to minimize.
[2024-06-01 15:48:55] [INFO ] Deduced a trap composed of 175 places in 290 ms of which 4 ms to minimize.
[2024-06-01 15:48:55] [INFO ] Deduced a trap composed of 162 places in 407 ms of which 4 ms to minimize.
[2024-06-01 15:48:56] [INFO ] Deduced a trap composed of 168 places in 366 ms of which 4 ms to minimize.
[2024-06-01 15:48:56] [INFO ] Deduced a trap composed of 167 places in 355 ms of which 4 ms to minimize.
[2024-06-01 15:48:57] [INFO ] Deduced a trap composed of 157 places in 389 ms of which 3 ms to minimize.
[2024-06-01 15:48:57] [INFO ] Deduced a trap composed of 115 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:48:57] [INFO ] Deduced a trap composed of 214 places in 379 ms of which 5 ms to minimize.
[2024-06-01 15:48:58] [INFO ] Deduced a trap composed of 112 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:48:58] [INFO ] Deduced a trap composed of 181 places in 374 ms of which 4 ms to minimize.
[2024-06-01 15:48:59] [INFO ] Deduced a trap composed of 157 places in 381 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 15:49:01] [INFO ] Deduced a trap composed of 175 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:49:02] [INFO ] Deduced a trap composed of 155 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:49:02] [INFO ] Deduced a trap composed of 117 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:49:02] [INFO ] Deduced a trap composed of 169 places in 292 ms of which 4 ms to minimize.
[2024-06-01 15:49:03] [INFO ] Deduced a trap composed of 95 places in 347 ms of which 4 ms to minimize.
[2024-06-01 15:49:03] [INFO ] Deduced a trap composed of 111 places in 378 ms of which 4 ms to minimize.
[2024-06-01 15:49:04] [INFO ] Deduced a trap composed of 140 places in 393 ms of which 3 ms to minimize.
[2024-06-01 15:49:04] [INFO ] Deduced a trap composed of 77 places in 299 ms of which 3 ms to minimize.
[2024-06-01 15:49:04] [INFO ] Deduced a trap composed of 113 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:49:05] [INFO ] Deduced a trap composed of 187 places in 306 ms of which 4 ms to minimize.
[2024-06-01 15:49:05] [INFO ] Deduced a trap composed of 194 places in 354 ms of which 4 ms to minimize.
[2024-06-01 15:49:06] [INFO ] Deduced a trap composed of 163 places in 351 ms of which 3 ms to minimize.
[2024-06-01 15:49:06] [INFO ] Deduced a trap composed of 197 places in 372 ms of which 3 ms to minimize.
[2024-06-01 15:49:06] [INFO ] Deduced a trap composed of 148 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 103 places in 400 ms of which 4 ms to minimize.
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 97 places in 407 ms of which 3 ms to minimize.
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 135 places in 386 ms of which 3 ms to minimize.
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 143 places in 346 ms of which 3 ms to minimize.
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 105 places in 397 ms of which 4 ms to minimize.
[2024-06-01 15:49:09] [INFO ] Deduced a trap composed of 175 places in 401 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 15:49:13] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:49:13] [INFO ] Deduced a trap composed of 115 places in 341 ms of which 4 ms to minimize.
[2024-06-01 15:49:13] [INFO ] Deduced a trap composed of 180 places in 366 ms of which 3 ms to minimize.
[2024-06-01 15:49:14] [INFO ] Deduced a trap composed of 158 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:49:14] [INFO ] Deduced a trap composed of 149 places in 337 ms of which 3 ms to minimize.
[2024-06-01 15:49:14] [INFO ] Deduced a trap composed of 150 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:49:15] [INFO ] Deduced a trap composed of 169 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:49:15] [INFO ] Deduced a trap composed of 139 places in 346 ms of which 3 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 155 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 213 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:49:16] [INFO ] Deduced a trap composed of 168 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:49:17] [INFO ] Deduced a trap composed of 110 places in 349 ms of which 4 ms to minimize.
[2024-06-01 15:49:17] [INFO ] Deduced a trap composed of 173 places in 355 ms of which 4 ms to minimize.
[2024-06-01 15:49:17] [INFO ] Deduced a trap composed of 133 places in 347 ms of which 4 ms to minimize.
SMT process timed out in 63393ms, After SMT, problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 63458ms
Starting structural reductions in LTL mode, iteration 1 : 348/401 places, 1135/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66192 ms. Remains : 348/401 places, 1135/1328 transitions.
Support contains 106 out of 348 places after structural reductions.
[2024-06-01 15:49:18] [INFO ] Flatten gal took : 174 ms
[2024-06-01 15:49:18] [INFO ] Flatten gal took : 115 ms
[2024-06-01 15:49:18] [INFO ] Input system was already deterministic with 1135 transitions.
Support contains 104 out of 348 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3336 ms. (11 steps per ms) remains 46/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
[2024-06-01 15:49:20] [INFO ] Invariant cache hit.
[2024-06-01 15:49:20] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 276/313 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 31/344 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 7 (OVERLAPS) 4/348 variables, 5/19 constraints. Problems are: Problem set: 8 solved, 8 unsolved
[2024-06-01 15:49:21] [INFO ] Deduced a trap composed of 118 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:49:21] [INFO ] Deduced a trap composed of 107 places in 394 ms of which 4 ms to minimize.
[2024-06-01 15:49:21] [INFO ] Deduced a trap composed of 103 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:49:22] [INFO ] Deduced a trap composed of 49 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:49:22] [INFO ] Deduced a trap composed of 130 places in 376 ms of which 4 ms to minimize.
[2024-06-01 15:49:22] [INFO ] Deduced a trap composed of 150 places in 389 ms of which 3 ms to minimize.
[2024-06-01 15:49:23] [INFO ] Deduced a trap composed of 175 places in 356 ms of which 3 ms to minimize.
[2024-06-01 15:49:23] [INFO ] Deduced a trap composed of 145 places in 355 ms of which 4 ms to minimize.
[2024-06-01 15:49:24] [INFO ] Deduced a trap composed of 121 places in 372 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 9/28 constraints. Problems are: Problem set: 8 solved, 8 unsolved
[2024-06-01 15:49:24] [INFO ] Deduced a trap composed of 121 places in 357 ms of which 3 ms to minimize.
[2024-06-01 15:49:25] [INFO ] Deduced a trap composed of 91 places in 385 ms of which 4 ms to minimize.
[2024-06-01 15:49:25] [INFO ] Deduced a trap composed of 133 places in 378 ms of which 4 ms to minimize.
SMT process timed out in 5234ms, After SMT, problems are : Problem set: 8 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 348 transition count 1080
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 293 transition count 1080
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 161 place count 242 transition count 483
Iterating global reduction 0 with 51 rules applied. Total rules applied 212 place count 242 transition count 483
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 214 place count 241 transition count 482
Applied a total of 214 rules in 94 ms. Remains 241 /348 variables (removed 107) and now considering 482/1135 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 241/348 places, 482/1135 transitions.
RANDOM walk for 40000 steps (8 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 147103 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :1 out of 8
Probabilistic random walk after 147103 steps, saw 100141 distinct states, run finished after 3011 ms. (steps per millisecond=48 ) properties seen :1
// Phase 1: matrix 482 rows 241 cols
[2024-06-01 15:49:29] [INFO ] Computed 19 invariants in 11 ms
[2024-06-01 15:49:29] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 217/231 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/234 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/241 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 15:49:29] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:49:29] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 15:49:30] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:49:30] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 482/723 variables, 241/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/723 variables, 56/320 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/723 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/723 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 723/723 variables, and 320 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 241/241 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 217/231 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/234 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 6 (OVERLAPS) 7/241 variables, 7/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 4/23 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 15:49:31] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:49:31] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:49:31] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:49:32] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:49:32] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:49:32] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 6/29 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 15:49:32] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 482/723 variables, 241/271 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/723 variables, 56/327 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/723 variables, 6/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/723 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/723 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 723/723 variables, and 333 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3488 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 241/241 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 11/11 constraints]
After SMT, in 5323ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 0 properties in 2854 ms.
Support contains 10 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 482/482 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 240 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 240 transition count 467
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 4 place count 239 transition count 466
Applied a total of 4 rules in 43 ms. Remains 239 /241 variables (removed 2) and now considering 466/482 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 239/241 places, 466/482 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
// Phase 1: matrix 466 rows 239 cols
[2024-06-01 15:49:37] [INFO ] Computed 19 invariants in 14 ms
[2024-06-01 15:49:38] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/230 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 9/239 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:38] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 466/705 variables, 239/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 56/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/705 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 315 constraints, problems are : Problem set: 0 solved, 5 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 239/239 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 210/218 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/230 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:39] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/239 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:39] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:39] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:49:39] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:40] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:40] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:40] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 15:49:40] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:49:41] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:49:41] [INFO ] Deduced a trap composed of 116 places in 176 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 466/705 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 56/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/705 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 705/705 variables, and 330 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3314 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 239/239 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 4194ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1239 ms.
Support contains 8 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 466/466 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 238 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 238 transition count 451
Applied a total of 2 rules in 28 ms. Remains 238 /239 variables (removed 1) and now considering 451/466 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 238/239 places, 451/466 transitions.
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 211945 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :1 out of 5
Probabilistic random walk after 211945 steps, saw 142516 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :1
// Phase 1: matrix 451 rows 238 cols
[2024-06-01 15:49:46] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 15:49:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/217 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/229 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/238 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 15:49:47] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:49:47] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 451/689 variables, 238/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 56/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/689 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 238/238 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/217 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/229 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/238 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 124 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 118 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 94 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:49:49] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:49:49] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:49:49] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:49:49] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:49:49] [INFO ] Deduced a trap composed of 96 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:49:50] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:49:50] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:49:50] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:49:50] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:49:50] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:49:51] [INFO ] Deduced a trap composed of 121 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:49:51] [INFO ] Deduced a trap composed of 112 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:49:51] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 451/689 variables, 238/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 56/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/689 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 337 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 238/238 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 5977ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1558 ms.
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 451/451 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 237 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 436
Applied a total of 2 rules in 34 ms. Remains 237 /238 variables (removed 1) and now considering 436/451 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 237/238 places, 436/451 transitions.
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 222995 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :1 out of 4
Probabilistic random walk after 222995 steps, saw 149862 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :1
// Phase 1: matrix 436 rows 237 cols
[2024-06-01 15:49:57] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 15:49:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/237 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:49:58] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:49:58] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:49:58] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:49:58] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:49:58] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:49:59] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:49:59] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 436/673 variables, 237/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 56/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 319 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/237 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 436/673 variables, 237/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 56/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 237/237 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 2858ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 436/436 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 236 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 421
Applied a total of 2 rules in 18 ms. Remains 236 /237 variables (removed 1) and now considering 421/436 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/237 places, 421/436 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 470168 steps, run visited all 3 properties in 2524 ms. (steps per millisecond=186 )
Probabilistic random walk after 470168 steps, saw 308430 distinct states, run finished after 2531 ms. (steps per millisecond=185 ) properties seen :3
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 61 ms
[2024-06-01 15:50:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Anderson-PT-08-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:50:03] [INFO ] Input system was already deterministic with 1135 transitions.
Support contains 90 out of 348 places (down from 93) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 348 transition count 1079
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 292 transition count 1079
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 170 place count 234 transition count 391
Iterating global reduction 0 with 58 rules applied. Total rules applied 228 place count 234 transition count 391
Applied a total of 228 rules in 33 ms. Remains 234 /348 variables (removed 114) and now considering 391/1135 (removed 744) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 234/348 places, 391/1135 transitions.
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:03] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 295 transition count 508
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 295 transition count 508
Applied a total of 106 rules in 8 ms. Remains 295 /348 variables (removed 53) and now considering 508/1135 (removed 627) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 295/348 places, 508/1135 transitions.
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:50:03] [INFO ] Input system was already deterministic with 508 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 294 transition count 507
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 294 transition count 507
Applied a total of 108 rules in 25 ms. Remains 294 /348 variables (removed 54) and now considering 507/1135 (removed 628) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 294/348 places, 507/1135 transitions.
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:50:03] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:50:03] [INFO ] Input system was already deterministic with 507 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 348 transition count 1079
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 292 transition count 1079
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 167 place count 237 transition count 436
Iterating global reduction 0 with 55 rules applied. Total rules applied 222 place count 237 transition count 436
Applied a total of 222 rules in 69 ms. Remains 237 /348 variables (removed 111) and now considering 436/1135 (removed 699) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 237/348 places, 436/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 36 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:50:04] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 293 transition count 464
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 293 transition count 464
Applied a total of 110 rules in 9 ms. Remains 293 /348 variables (removed 55) and now considering 464/1135 (removed 671) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 293/348 places, 464/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 32 ms
[2024-06-01 15:50:04] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 296 transition count 523
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 296 transition count 523
Applied a total of 104 rules in 9 ms. Remains 296 /348 variables (removed 52) and now considering 523/1135 (removed 612) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 296/348 places, 523/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:50:04] [INFO ] Input system was already deterministic with 523 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 348 transition count 1080
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 293 transition count 1080
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 167 place count 236 transition count 393
Iterating global reduction 0 with 57 rules applied. Total rules applied 224 place count 236 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 226 place count 235 transition count 392
Applied a total of 226 rules in 64 ms. Remains 235 /348 variables (removed 113) and now considering 392/1135 (removed 743) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 235/348 places, 392/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 32 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:50:04] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 289 transition count 432
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 289 transition count 432
Applied a total of 118 rules in 23 ms. Remains 289 /348 variables (removed 59) and now considering 432/1135 (removed 703) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 289/348 places, 432/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:50:04] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 297 transition count 510
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 297 transition count 510
Applied a total of 102 rules in 23 ms. Remains 297 /348 variables (removed 51) and now considering 510/1135 (removed 625) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 297/348 places, 510/1135 transitions.
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:50:04] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 289 transition count 432
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 289 transition count 432
Applied a total of 118 rules in 20 ms. Remains 289 /348 variables (removed 59) and now considering 432/1135 (removed 703) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 289/348 places, 432/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 294 transition count 493
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 294 transition count 493
Applied a total of 108 rules in 10 ms. Remains 294 /348 variables (removed 54) and now considering 493/1135 (removed 642) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 294/348 places, 493/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 493 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 296 transition count 537
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 296 transition count 537
Applied a total of 104 rules in 10 ms. Remains 296 /348 variables (removed 52) and now considering 537/1135 (removed 598) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 296/348 places, 537/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 299 transition count 554
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 299 transition count 554
Applied a total of 98 rules in 15 ms. Remains 299 /348 variables (removed 49) and now considering 554/1135 (removed 581) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 299/348 places, 554/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 554 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 348 transition count 1079
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 292 transition count 1079
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 170 place count 234 transition count 391
Iterating global reduction 0 with 58 rules applied. Total rules applied 228 place count 234 transition count 391
Applied a total of 228 rules in 31 ms. Remains 234 /348 variables (removed 114) and now considering 391/1135 (removed 744) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 234/348 places, 391/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 1135/1135 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 293 transition count 492
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 293 transition count 492
Applied a total of 110 rules in 19 ms. Remains 293 /348 variables (removed 55) and now considering 492/1135 (removed 643) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 293/348 places, 492/1135 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:50:05] [INFO ] Input system was already deterministic with 492 transitions.
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:50:05] [INFO ] Flatten gal took : 40 ms
[2024-06-01 15:50:05] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-06-01 15:50:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 348 places, 1135 transitions and 4402 arcs took 13 ms.
Total runtime 114827 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 : Anderson-PT-08-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-06
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2024-11
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-08-CTLFireability-2023-15

BK_STOP 1717257006359

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Anderson-PT-08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1030/ctl_0_
ctl formula name Anderson-PT-08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1030/ctl_1_
ctl formula name Anderson-PT-08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1030/ctl_2_
ctl formula name Anderson-PT-08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1030/ctl_3_
ctl formula name Anderson-PT-08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1030/ctl_4_
ctl formula name Anderson-PT-08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1030/ctl_5_
ctl formula name Anderson-PT-08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1030/ctl_6_
ctl formula name Anderson-PT-08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1030/ctl_7_
ctl formula name Anderson-PT-08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1030/ctl_8_
ctl formula name Anderson-PT-08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1030/ctl_9_
ctl formula name Anderson-PT-08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1030/ctl_10_
ctl formula name Anderson-PT-08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1030/ctl_11_
ctl formula name Anderson-PT-08-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1030/ctl_12_
ctl formula name Anderson-PT-08-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1030/ctl_13_
ctl formula name Anderson-PT-08-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1030/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="Anderson-PT-08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118300346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;