About the Execution of ITS-Tools for PolyORBLF-PT-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.955 | 2770886.00 | 2962882.00 | 2036.60 | F???TF?T????T?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700233.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 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 PolyORBLF-PT-S02J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716914150996
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 16:35:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:35:52] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-28 16:35:52] [INFO ] Transformed 752 places.
[2024-05-28 16:35:52] [INFO ] Transformed 1572 transitions.
[2024-05-28 16:35:53] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 550 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 745 transition count 1405
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 745 transition count 1405
Applied a total of 14 rules in 105 ms. Remains 745 /752 variables (removed 7) and now considering 1405/1412 (removed 7) transitions.
Running 1403 sub problems to find dead transitions.
[2024-05-28 16:35:53] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
// Phase 1: matrix 1385 rows 745 cols
[2024-05-28 16:35:53] [INFO ] Computed 54 invariants in 82 ms
[2024-05-28 16:35:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 16:36:11] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 27 ms to minimize.
[2024-05-28 16:36:11] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2024-05-28 16:36:11] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:36:12] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:36:13] [INFO ] Deduced a trap composed of 397 places in 328 ms of which 5 ms to minimize.
[2024-05-28 16:36:13] [INFO ] Deduced a trap composed of 379 places in 313 ms of which 6 ms to minimize.
[2024-05-28 16:36:13] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:36:14] [INFO ] Deduced a trap composed of 524 places in 442 ms of which 6 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 504 places in 390 ms of which 5 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 497 places in 301 ms of which 4 ms to minimize.
[2024-05-28 16:36:15] [INFO ] Deduced a trap composed of 478 places in 301 ms of which 4 ms to minimize.
SMT process timed out in 22599ms, After SMT, problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 22703ms
[2024-05-28 16:36:16] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 16:36:16] [INFO ] Invariant cache hit.
[2024-05-28 16:36:16] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-28 16:36:16] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 16:36:16] [INFO ] Invariant cache hit.
[2024-05-28 16:36:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 16:36:23] [INFO ] Implicit Places using invariants and state equation in 7201 ms returned []
Implicit Place search using SMT with State Equation took 7456 ms to find 0 implicit places.
Running 1403 sub problems to find dead transitions.
[2024-05-28 16:36:23] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 16:36:23] [INFO ] Invariant cache hit.
[2024-05-28 16:36:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 4 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 14 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 29 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 386 places in 404 ms of which 4 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 457 places in 389 ms of which 4 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 391 places in 411 ms of which 5 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 396 places in 398 ms of which 5 ms to minimize.
[2024-05-28 16:36:43] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 6 ms to minimize.
[2024-05-28 16:36:44] [INFO ] Deduced a trap composed of 399 places in 400 ms of which 6 ms to minimize.
[2024-05-28 16:36:44] [INFO ] Deduced a trap composed of 399 places in 374 ms of which 6 ms to minimize.
[2024-05-28 16:36:45] [INFO ] Deduced a trap composed of 405 places in 352 ms of which 6 ms to minimize.
[2024-05-28 16:36:45] [INFO ] Deduced a trap composed of 263 places in 381 ms of which 5 ms to minimize.
[2024-05-28 16:36:46] [INFO ] Deduced a trap composed of 237 places in 383 ms of which 6 ms to minimize.
[2024-05-28 16:36:46] [INFO ] Deduced a trap composed of 229 places in 361 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 16:36:50] [INFO ] Deduced a trap composed of 417 places in 403 ms of which 6 ms to minimize.
[2024-05-28 16:36:50] [INFO ] Deduced a trap composed of 403 places in 326 ms of which 4 ms to minimize.
[2024-05-28 16:36:50] [INFO ] Deduced a trap composed of 403 places in 273 ms of which 4 ms to minimize.
[2024-05-28 16:36:50] [INFO ] Deduced a trap composed of 430 places in 276 ms of which 5 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 482 places in 387 ms of which 5 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 433 places in 268 ms of which 3 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 388 places in 278 ms of which 4 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 3 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 6 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 395 places in 354 ms of which 4 ms to minimize.
[2024-05-28 16:36:55] [INFO ] Deduced a trap composed of 429 places in 387 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2130 variables, and 82 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/745 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1403/1403 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 16:37:17] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 512 places in 503 ms of which 5 ms to minimize.
[2024-05-28 16:37:18] [INFO ] Deduced a trap composed of 509 places in 414 ms of which 6 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 492 places in 446 ms of which 6 ms to minimize.
[2024-05-28 16:37:19] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 5 ms to minimize.
[2024-05-28 16:37:20] [INFO ] Deduced a trap composed of 491 places in 382 ms of which 7 ms to minimize.
[2024-05-28 16:37:21] [INFO ] Deduced a trap composed of 397 places in 420 ms of which 6 ms to minimize.
[2024-05-28 16:37:23] [INFO ] Deduced a trap composed of 420 places in 442 ms of which 7 ms to minimize.
[2024-05-28 16:37:24] [INFO ] Deduced a trap composed of 410 places in 341 ms of which 5 ms to minimize.
[2024-05-28 16:37:24] [INFO ] Deduced a trap composed of 374 places in 351 ms of which 4 ms to minimize.
[2024-05-28 16:37:24] [INFO ] Deduced a trap composed of 419 places in 342 ms of which 4 ms to minimize.
[2024-05-28 16:37:25] [INFO ] Deduced a trap composed of 422 places in 319 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2130 variables, and 94 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/745 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1403 constraints, Known Traps: 44/44 constraints]
After SMT, in 62364ms problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 62383ms
Starting structural reductions in LTL mode, iteration 1 : 745/752 places, 1405/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92729 ms. Remains : 745/752 places, 1405/1412 transitions.
Support contains 550 out of 745 places after structural reductions.
[2024-05-28 16:37:26] [INFO ] Flatten gal took : 152 ms
[2024-05-28 16:37:26] [INFO ] Flatten gal took : 104 ms
[2024-05-28 16:37:26] [INFO ] Input system was already deterministic with 1405 transitions.
RANDOM walk for 40000 steps (10 resets) in 2515 ms. (15 steps per ms) remains 74/100 properties
BEST_FIRST walk for 4002 steps (8 resets) in 177 ms. (22 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 99 ms. (40 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 74/74 properties
[2024-05-28 16:37:28] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 16:37:28] [INFO ] Invariant cache hit.
[2024-05-28 16:37:28] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 71 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 69 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 3 (OVERLAPS) 69/476 variables, 8/12 constraints. Problems are: Problem set: 18 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/12 constraints. Problems are: Problem set: 18 solved, 56 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 5 (OVERLAPS) 266/742 variables, 39/51 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/51 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/744 variables, 2/53 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/53 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/745 variables, 1/54 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 0/54 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1385/2130 variables, 745/799 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2130 variables, 120/919 constraints. Problems are: Problem set: 65 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2130/2130 variables, and 919 constraints, problems are : Problem set: 65 solved, 9 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 745/745 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 65 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/47 variables, 2/2 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 65 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (OVERLAPS) 646/693 variables, 18/20 constraints. Problems are: Problem set: 66 solved, 8 unsolved
[2024-05-28 16:37:34] [INFO ] Deduced a trap composed of 456 places in 454 ms of which 6 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 446 places in 483 ms of which 4 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 404 places in 354 ms of which 5 ms to minimize.
[2024-05-28 16:37:35] [INFO ] Deduced a trap composed of 430 places in 358 ms of which 5 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 433 places in 353 ms of which 4 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 433 places in 287 ms of which 3 ms to minimize.
[2024-05-28 16:37:36] [INFO ] Deduced a trap composed of 437 places in 285 ms of which 3 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 419 places in 281 ms of which 4 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 450 places in 278 ms of which 3 ms to minimize.
[2024-05-28 16:37:37] [INFO ] Deduced a trap composed of 448 places in 271 ms of which 3 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 405 places in 281 ms of which 4 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 433 places in 279 ms of which 3 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 442 places in 360 ms of which 3 ms to minimize.
[2024-05-28 16:37:38] [INFO ] Deduced a trap composed of 447 places in 294 ms of which 4 ms to minimize.
SMT process timed out in 10427ms, After SMT, problems are : Problem set: 66 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 743 transition count 1330
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 668 transition count 1329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 667 transition count 1329
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 154 place count 667 transition count 1250
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 312 place count 588 transition count 1250
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 476 place count 506 transition count 1168
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 496 place count 506 transition count 1148
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 516 place count 486 transition count 1148
Applied a total of 516 rules in 228 ms. Remains 486 /745 variables (removed 259) and now considering 1148/1405 (removed 257) transitions.
Running 1146 sub problems to find dead transitions.
[2024-05-28 16:37:39] [INFO ] Flow matrix only has 1128 transitions (discarded 20 similar events)
// Phase 1: matrix 1128 rows 486 cols
[2024-05-28 16:37:39] [INFO ] Computed 52 invariants in 37 ms
[2024-05-28 16:37:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-28 16:37:48] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:37:49] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:37:50] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:37:50] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:37:50] [INFO ] Deduced a trap composed of 67 places in 316 ms of which 4 ms to minimize.
[2024-05-28 16:37:51] [INFO ] Deduced a trap composed of 98 places in 286 ms of which 4 ms to minimize.
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 280 places in 316 ms of which 3 ms to minimize.
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 305 places in 305 ms of which 3 ms to minimize.
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 303 places in 290 ms of which 4 ms to minimize.
[2024-05-28 16:37:53] [INFO ] Deduced a trap composed of 301 places in 255 ms of which 3 ms to minimize.
[2024-05-28 16:37:53] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:37:54] [INFO ] Deduced a trap composed of 193 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 172 places in 256 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 185 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 276 places in 286 ms of which 4 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 297 places in 260 ms of which 4 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 275 places in 309 ms of which 4 ms to minimize.
SMT process timed out in 22651ms, After SMT, problems are : Problem set: 0 solved, 1146 unsolved
Search for dead transitions found 0 dead transitions in 22665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22897 ms. Remains : 486/745 places, 1148/1405 transitions.
RANDOM walk for 40000 steps (15 resets) in 583 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 100268 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 8
Probabilistic random walk after 100268 steps, saw 67239 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-28 16:38:05] [INFO ] Flow matrix only has 1128 transitions (discarded 20 similar events)
[2024-05-28 16:38:05] [INFO ] Invariant cache hit.
[2024-05-28 16:38:05] [INFO ] State equation strengthened by 120 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 389/436 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/449 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 35/484 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1128/1612 variables, 484/535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 120/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1614 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1614 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1614 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1614 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 658 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 486/486 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 389/436 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 222 places in 301 ms of which 3 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 3 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 277 places in 290 ms of which 3 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 3 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 252 places in 287 ms of which 3 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 3 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 246 places in 230 ms of which 2 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 3 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 294 places in 254 ms of which 2 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 243 places in 242 ms of which 2 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 3 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:38:17] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:38:17] [INFO ] Deduced a trap composed of 296 places in 236 ms of which 3 ms to minimize.
[2024-05-28 16:38:17] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:38:17] [INFO ] Deduced a trap composed of 292 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:38:18] [INFO ] Deduced a trap composed of 240 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:38:18] [INFO ] Deduced a trap composed of 254 places in 212 ms of which 3 ms to minimize.
[2024-05-28 16:38:18] [INFO ] Deduced a trap composed of 249 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:24] [INFO ] Deduced a trap composed of 143 places in 260 ms of which 3 ms to minimize.
[2024-05-28 16:38:25] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 2 ms to minimize.
[2024-05-28 16:38:25] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:38:25] [INFO ] Deduced a trap composed of 203 places in 263 ms of which 3 ms to minimize.
[2024-05-28 16:38:26] [INFO ] Deduced a trap composed of 194 places in 297 ms of which 4 ms to minimize.
[2024-05-28 16:38:26] [INFO ] Deduced a trap composed of 269 places in 290 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:28] [INFO ] Deduced a trap composed of 222 places in 309 ms of which 4 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 252 places in 278 ms of which 3 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 4 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 3 ms to minimize.
[2024-05-28 16:38:29] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:38:30] [INFO ] Deduced a trap composed of 246 places in 225 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 13/449 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:32] [INFO ] Deduced a trap composed of 132 places in 287 ms of which 3 ms to minimize.
[2024-05-28 16:38:32] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:34] [INFO ] Deduced a trap composed of 187 places in 349 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 35/484 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 2 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:38:38] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2024-05-28 16:38:39] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 3 ms to minimize.
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 10/96 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1128/1612 variables, 484/580 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1614 variables, and 700 constraints, problems are : Problem set: 2 solved, 6 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 484/486 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 45/45 constraints]
After SMT, in 52177ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 1148/1148 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 486 transition count 1147
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 485 transition count 1147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 484 transition count 1146
Applied a total of 4 rules in 107 ms. Remains 484 /486 variables (removed 2) and now considering 1146/1148 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 484/486 places, 1146/1148 transitions.
RANDOM walk for 40000 steps (14 resets) in 591 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (12 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 112940 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 112940 steps, saw 72108 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-28 16:39:01] [INFO ] Flow matrix only has 1126 transitions (discarded 20 similar events)
// Phase 1: matrix 1126 rows 484 cols
[2024-05-28 16:39:01] [INFO ] Computed 52 invariants in 56 ms
[2024-05-28 16:39:01] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 71/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 347/430 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13/443 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 39/482 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1126/1608 variables, 482/533 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1608 variables, 120/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1608 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/1610 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1610 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 656 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 484/484 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 71/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 347/430 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13/443 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 39/482 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1126/1608 variables, 482/542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1608 variables, 120/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1608 variables, 6/668 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-28 16:39:41] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 4 ms to minimize.
[2024-05-28 16:39:41] [INFO ] Deduced a trap composed of 212 places in 342 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1608 variables, 2/670 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1608 variables, 0/670 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 77160ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12596 ms.
Support contains 7 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 1146/1146 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 481 transition count 1143
Applied a total of 6 rules in 43 ms. Remains 481 /484 variables (removed 3) and now considering 1143/1146 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 481/484 places, 1143/1146 transitions.
Successfully simplified 70 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:40:31] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 16:40:31] [INFO ] Flatten gal took : 66 ms
[2024-05-28 16:40:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:40:31] [INFO ] Flatten gal took : 66 ms
[2024-05-28 16:40:31] [INFO ] Input system was already deterministic with 1405 transitions.
Support contains 131 out of 745 places (down from 190) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 69 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:40:31] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 16:40:31] [INFO ] Computed 52 invariants in 35 ms
[2024-05-28 16:40:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:40:48] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:40:49] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 387 places in 439 ms of which 5 ms to minimize.
[2024-05-28 16:40:50] [INFO ] Deduced a trap composed of 388 places in 434 ms of which 6 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 380 places in 378 ms of which 5 ms to minimize.
[2024-05-28 16:40:51] [INFO ] Deduced a trap composed of 369 places in 299 ms of which 3 ms to minimize.
[2024-05-28 16:40:52] [INFO ] Deduced a trap composed of 496 places in 413 ms of which 6 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 517 places in 411 ms of which 5 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 494 places in 388 ms of which 6 ms to minimize.
[2024-05-28 16:40:53] [INFO ] Deduced a trap composed of 527 places in 379 ms of which 4 ms to minimize.
SMT process timed out in 21944ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21958ms
[2024-05-28 16:40:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:40:53] [INFO ] Invariant cache hit.
[2024-05-28 16:40:54] [INFO ] Implicit Places using invariants in 684 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 690 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 24 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22745 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:40:54] [INFO ] Flatten gal took : 58 ms
[2024-05-28 16:40:54] [INFO ] Flatten gal took : 68 ms
[2024-05-28 16:40:54] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:40:54] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:40:55] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:40:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11272438165203922680.gal : 32 ms
[2024-05-28 16:40:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4965960437229149114.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11272438165203922680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4965960437229149114.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:41:25] [INFO ] Flatten gal took : 88 ms
[2024-05-28 16:41:25] [INFO ] Applying decomposition
[2024-05-28 16:41:25] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15632883071269431717.txt' '-o' '/tmp/graph15632883071269431717.bin' '-w' '/tmp/graph15632883071269431717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15632883071269431717.bin' '-l' '-1' '-v' '-w' '/tmp/graph15632883071269431717.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:41:25] [INFO ] Decomposing Gal with order
[2024-05-28 16:41:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:41:26] [INFO ] Removed a total of 1238 redundant transitions.
[2024-05-28 16:41:26] [INFO ] Flatten gal took : 260 ms
[2024-05-28 16:41:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 64 ms.
[2024-05-28 16:41:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7595421484978242328.gal : 26 ms
[2024-05-28 16:41:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8109325988555239838.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7595421484978242328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8109325988555239838.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 62 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:41:56] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:41:56] [INFO ] Invariant cache hit.
[2024-05-28 16:41:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:42:11] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 3 ms to minimize.
[2024-05-28 16:42:11] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:42:12] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:42:13] [INFO ] Deduced a trap composed of 372 places in 439 ms of which 5 ms to minimize.
[2024-05-28 16:42:13] [INFO ] Deduced a trap composed of 373 places in 421 ms of which 6 ms to minimize.
[2024-05-28 16:42:14] [INFO ] Deduced a trap composed of 98 places in 353 ms of which 4 ms to minimize.
[2024-05-28 16:42:15] [INFO ] Deduced a trap composed of 369 places in 439 ms of which 6 ms to minimize.
[2024-05-28 16:42:15] [INFO ] Deduced a trap composed of 409 places in 435 ms of which 5 ms to minimize.
[2024-05-28 16:42:16] [INFO ] Deduced a trap composed of 490 places in 445 ms of which 5 ms to minimize.
[2024-05-28 16:42:17] [INFO ] Deduced a trap composed of 250 places in 456 ms of which 6 ms to minimize.
[2024-05-28 16:42:17] [INFO ] Deduced a trap composed of 208 places in 395 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:42:36] [INFO ] Deduced a trap composed of 398 places in 468 ms of which 7 ms to minimize.
[2024-05-28 16:42:36] [INFO ] Deduced a trap composed of 420 places in 402 ms of which 5 ms to minimize.
[2024-05-28 16:42:37] [INFO ] Deduced a trap composed of 405 places in 456 ms of which 5 ms to minimize.
[2024-05-28 16:42:37] [INFO ] Deduced a trap composed of 398 places in 415 ms of which 5 ms to minimize.
[2024-05-28 16:42:38] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:42:38] [INFO ] Deduced a trap composed of 69 places in 470 ms of which 5 ms to minimize.
SMT process timed out in 42264ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42281ms
[2024-05-28 16:42:38] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:42:38] [INFO ] Invariant cache hit.
[2024-05-28 16:42:39] [INFO ] Implicit Places using invariants in 859 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 863 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 16 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43227 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:42:39] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:42:39] [INFO ] Flatten gal took : 58 ms
[2024-05-28 16:42:39] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:42:39] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:42:39] [INFO ] Flatten gal took : 42 ms
[2024-05-28 16:42:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality18442619790832345480.gal : 6 ms
[2024-05-28 16:42:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17691820997719779605.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18442619790832345480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17691820997719779605.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:43:10] [INFO ] Flatten gal took : 83 ms
[2024-05-28 16:43:10] [INFO ] Applying decomposition
[2024-05-28 16:43:10] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16350711348508516700.txt' '-o' '/tmp/graph16350711348508516700.bin' '-w' '/tmp/graph16350711348508516700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16350711348508516700.bin' '-l' '-1' '-v' '-w' '/tmp/graph16350711348508516700.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:43:10] [INFO ] Decomposing Gal with order
[2024-05-28 16:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:43:10] [INFO ] Removed a total of 1501 redundant transitions.
[2024-05-28 16:43:10] [INFO ] Flatten gal took : 127 ms
[2024-05-28 16:43:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 34 ms.
[2024-05-28 16:43:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14692837840985492247.gal : 12 ms
[2024-05-28 16:43:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality18005585211610869273.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14692837840985492247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18005585211610869273.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 65 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:43:40] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:43:41] [INFO ] Invariant cache hit.
[2024-05-28 16:43:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-28 16:43:55] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:43:56] [INFO ] Deduced a trap composed of 372 places in 395 ms of which 5 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 373 places in 382 ms of which 5 ms to minimize.
[2024-05-28 16:43:57] [INFO ] Deduced a trap composed of 98 places in 347 ms of which 5 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 369 places in 400 ms of which 6 ms to minimize.
[2024-05-28 16:43:58] [INFO ] Deduced a trap composed of 409 places in 384 ms of which 5 ms to minimize.
[2024-05-28 16:43:59] [INFO ] Deduced a trap composed of 490 places in 398 ms of which 5 ms to minimize.
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 250 places in 416 ms of which 5 ms to minimize.
[2024-05-28 16:44:00] [INFO ] Deduced a trap composed of 208 places in 415 ms of which 5 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 401 places in 379 ms of which 5 ms to minimize.
[2024-05-28 16:44:02] [INFO ] Deduced a trap composed of 400 places in 377 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 399 places in 453 ms of which 6 ms to minimize.
[2024-05-28 16:44:22] [INFO ] Deduced a trap composed of 396 places in 439 ms of which 5 ms to minimize.
[2024-05-28 16:44:22] [INFO ] Deduced a trap composed of 403 places in 434 ms of which 6 ms to minimize.
[2024-05-28 16:44:23] [INFO ] Deduced a trap composed of 509 places in 453 ms of which 7 ms to minimize.
SMT process timed out in 42089ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42106ms
[2024-05-28 16:44:23] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:44:23] [INFO ] Invariant cache hit.
[2024-05-28 16:44:23] [INFO ] Implicit Places using invariants in 726 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 729 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 12 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42917 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:44:23] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:44:23] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:44:24] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:44:24] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:44:24] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15539260662127651885.gal : 6 ms
[2024-05-28 16:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality378099081271645601.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15539260662127651885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality378099081271645601.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:44:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:44:54] [INFO ] Applying decomposition
[2024-05-28 16:44:54] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph700030643188353869.txt' '-o' '/tmp/graph700030643188353869.bin' '-w' '/tmp/graph700030643188353869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph700030643188353869.bin' '-l' '-1' '-v' '-w' '/tmp/graph700030643188353869.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:44:54] [INFO ] Decomposing Gal with order
[2024-05-28 16:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:44:54] [INFO ] Removed a total of 1251 redundant transitions.
[2024-05-28 16:44:54] [INFO ] Flatten gal took : 92 ms
[2024-05-28 16:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 22 ms.
[2024-05-28 16:44:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18231445564866107378.gal : 11 ms
[2024-05-28 16:44:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9324870714769398722.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18231445564866107378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9324870714769398722.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 743 transition count 1339
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 677 transition count 1339
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 132 place count 677 transition count 1309
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 192 place count 647 transition count 1309
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 366 place count 560 transition count 1222
Applied a total of 366 rules in 149 ms. Remains 560 /745 variables (removed 185) and now considering 1222/1405 (removed 183) transitions.
Running 1220 sub problems to find dead transitions.
[2024-05-28 16:45:24] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2024-05-28 16:45:24] [INFO ] Computed 52 invariants in 33 ms
[2024-05-28 16:45:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 3 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 3 ms to minimize.
[2024-05-28 16:45:35] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 204 places in 305 ms of which 4 ms to minimize.
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 4 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 5 ms to minimize.
[2024-05-28 16:45:37] [INFO ] Deduced a trap composed of 90 places in 324 ms of which 4 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 239 places in 341 ms of which 4 ms to minimize.
[2024-05-28 16:45:38] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-28 16:45:39] [INFO ] Deduced a trap composed of 243 places in 363 ms of which 4 ms to minimize.
[2024-05-28 16:45:41] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 3 ms to minimize.
[2024-05-28 16:45:41] [INFO ] Deduced a trap composed of 350 places in 330 ms of which 4 ms to minimize.
[2024-05-28 16:45:44] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 5.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 9.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 6.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 (/ 2.0 3.0))
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 (/ 1.0 3.0))
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 (/ 2.0 3.0))
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 4.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 (/ 1.0 3.0))
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1762 variables, and 70 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 16:45:55] [INFO ] Deduced a trap composed of 239 places in 328 ms of which 4 ms to minimize.
[2024-05-28 16:45:57] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 262 places in 341 ms of which 4 ms to minimize.
[2024-05-28 16:46:02] [INFO ] Deduced a trap composed of 351 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1762 variables, and 74 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 24/24 constraints]
After SMT, in 42003ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 42014ms
[2024-05-28 16:46:06] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2024-05-28 16:46:06] [INFO ] Invariant cache hit.
[2024-05-28 16:46:07] [INFO ] Implicit Places using invariants in 676 ms returned [4, 69, 139, 201, 289, 320, 389, 429, 438, 501]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 678 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 550/745 places, 1222/1405 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 541 transition count 1213
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 541 transition count 1213
Applied a total of 18 rules in 33 ms. Remains 541 /550 variables (removed 9) and now considering 1213/1222 (removed 9) transitions.
[2024-05-28 16:46:07] [INFO ] Flow matrix only has 1193 transitions (discarded 20 similar events)
// Phase 1: matrix 1193 rows 541 cols
[2024-05-28 16:46:07] [INFO ] Computed 42 invariants in 14 ms
[2024-05-28 16:46:08] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-28 16:46:08] [INFO ] Flow matrix only has 1193 transitions (discarded 20 similar events)
[2024-05-28 16:46:08] [INFO ] Invariant cache hit.
[2024-05-28 16:46:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 16:46:21] [INFO ] Implicit Places using invariants and state equation in 13280 ms returned []
Implicit Place search using SMT with State Equation took 13805 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 541/745 places, 1213/1405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 56684 ms. Remains : 541/745 places, 1213/1405 transitions.
[2024-05-28 16:46:21] [INFO ] Flatten gal took : 75 ms
[2024-05-28 16:46:21] [INFO ] Flatten gal took : 61 ms
[2024-05-28 16:46:21] [INFO ] Input system was already deterministic with 1213 transitions.
RANDOM walk for 113 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 16:46:21] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:46:21] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:46:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality997147256951882063.gal : 7 ms
[2024-05-28 16:46:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15301695404859870967.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality997147256951882063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15301695404859870967.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 36 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:46:21] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 16:46:22] [INFO ] Computed 52 invariants in 19 ms
[2024-05-28 16:46:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:46:36] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 3 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:46:37] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 2 ms to minimize.
[2024-05-28 16:46:38] [INFO ] Deduced a trap composed of 387 places in 343 ms of which 4 ms to minimize.
[2024-05-28 16:46:38] [INFO ] Deduced a trap composed of 388 places in 332 ms of which 4 ms to minimize.
[2024-05-28 16:46:38] [INFO ] Deduced a trap composed of 380 places in 300 ms of which 4 ms to minimize.
[2024-05-28 16:46:39] [INFO ] Deduced a trap composed of 369 places in 292 ms of which 3 ms to minimize.
[2024-05-28 16:46:40] [INFO ] Deduced a trap composed of 496 places in 311 ms of which 3 ms to minimize.
[2024-05-28 16:46:40] [INFO ] Deduced a trap composed of 517 places in 311 ms of which 4 ms to minimize.
[2024-05-28 16:46:40] [INFO ] Deduced a trap composed of 494 places in 294 ms of which 4 ms to minimize.
[2024-05-28 16:46:41] [INFO ] Deduced a trap composed of 527 places in 296 ms of which 4 ms to minimize.
[2024-05-28 16:46:41] [INFO ] Deduced a trap composed of 504 places in 295 ms of which 4 ms to minimize.
[2024-05-28 16:46:41] [INFO ] Deduced a trap composed of 494 places in 293 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 41813ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41827ms
[2024-05-28 16:47:03] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:47:03] [INFO ] Invariant cache hit.
[2024-05-28 16:47:04] [INFO ] Implicit Places using invariants in 626 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 630 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 12 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42509 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:47:04] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:47:04] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:47:04] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:47:04] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:47:04] [INFO ] Flatten gal took : 65 ms
[2024-05-28 16:47:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality6514138194071383982.gal : 8 ms
[2024-05-28 16:47:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7786229455175319650.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6514138194071383982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7786229455175319650.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:47:35] [INFO ] Flatten gal took : 127 ms
[2024-05-28 16:47:35] [INFO ] Applying decomposition
[2024-05-28 16:47:35] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8197597475938829588.txt' '-o' '/tmp/graph8197597475938829588.bin' '-w' '/tmp/graph8197597475938829588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8197597475938829588.bin' '-l' '-1' '-v' '-w' '/tmp/graph8197597475938829588.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:47:35] [INFO ] Decomposing Gal with order
[2024-05-28 16:47:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:47:35] [INFO ] Removed a total of 1659 redundant transitions.
[2024-05-28 16:47:35] [INFO ] Flatten gal took : 116 ms
[2024-05-28 16:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 522 labels/synchronizations in 56 ms.
[2024-05-28 16:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality14425182755531032159.gal : 12 ms
[2024-05-28 16:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality8110548484197504106.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14425182755531032159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8110548484197504106.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 743 transition count 1329
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 667 transition count 1329
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 152 place count 667 transition count 1249
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 312 place count 587 transition count 1249
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 484 place count 501 transition count 1163
Applied a total of 484 rules in 74 ms. Remains 501 /745 variables (removed 244) and now considering 1163/1405 (removed 242) transitions.
Running 1161 sub problems to find dead transitions.
[2024-05-28 16:48:05] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2024-05-28 16:48:05] [INFO ] Computed 52 invariants in 32 ms
[2024-05-28 16:48:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-28 16:48:14] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:48:15] [INFO ] Deduced a trap composed of 108 places in 274 ms of which 3 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 105 places in 224 ms of which 2 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 2 ms to minimize.
[2024-05-28 16:48:16] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 194 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 2 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 305 places in 199 ms of which 2 ms to minimize.
[2024-05-28 16:48:17] [INFO ] Deduced a trap composed of 176 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 317 places in 268 ms of which 3 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 292 places in 221 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/1644 variables, and 72 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/1644 variables, and 72 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1161 constraints, Known Traps: 22/22 constraints]
After SMT, in 41704ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 41714ms
[2024-05-28 16:48:47] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-05-28 16:48:47] [INFO ] Invariant cache hit.
[2024-05-28 16:48:48] [INFO ] Implicit Places using invariants in 661 ms returned [3, 60, 124, 177, 258, 287, 347, 381, 389, 449]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 663 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 491/745 places, 1163/1405 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 482 transition count 1154
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 482 transition count 1154
Applied a total of 18 rules in 35 ms. Remains 482 /491 variables (removed 9) and now considering 1154/1163 (removed 9) transitions.
[2024-05-28 16:48:48] [INFO ] Flow matrix only has 1134 transitions (discarded 20 similar events)
// Phase 1: matrix 1134 rows 482 cols
[2024-05-28 16:48:48] [INFO ] Computed 42 invariants in 26 ms
[2024-05-28 16:48:48] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-28 16:48:48] [INFO ] Flow matrix only has 1134 transitions (discarded 20 similar events)
[2024-05-28 16:48:48] [INFO ] Invariant cache hit.
[2024-05-28 16:48:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 16:48:59] [INFO ] Implicit Places using invariants and state equation in 10074 ms returned []
Implicit Place search using SMT with State Equation took 10771 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 482/745 places, 1154/1405 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 53259 ms. Remains : 482/745 places, 1154/1405 transitions.
[2024-05-28 16:48:59] [INFO ] Flatten gal took : 110 ms
[2024-05-28 16:48:59] [INFO ] Flatten gal took : 30 ms
[2024-05-28 16:48:59] [INFO ] Input system was already deterministic with 1154 transitions.
[2024-05-28 16:48:59] [INFO ] Flatten gal took : 30 ms
[2024-05-28 16:48:59] [INFO ] Flatten gal took : 31 ms
[2024-05-28 16:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6062208277705407452.gal : 6 ms
[2024-05-28 16:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14102805307789663924.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6062208277705407452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14102805307789663924.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 43 ms
[2024-05-28 16:49:29] [INFO ] Applying decomposition
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8353706084462842790.txt' '-o' '/tmp/graph8353706084462842790.bin' '-w' '/tmp/graph8353706084462842790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8353706084462842790.bin' '-l' '-1' '-v' '-w' '/tmp/graph8353706084462842790.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:49:29] [INFO ] Decomposing Gal with order
[2024-05-28 16:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:49:29] [INFO ] Removed a total of 638 redundant transitions.
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 102 ms
[2024-05-28 16:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 6 ms.
[2024-05-28 16:49:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7479491216954675196.gal : 19 ms
[2024-05-28 16:49:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality5775825107569886400.ctl : 40 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7479491216954675196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5775825107569886400.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 27 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:50:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 16:50:00] [INFO ] Computed 52 invariants in 19 ms
[2024-05-28 16:50:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 3 ms to minimize.
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:50:13] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:50:14] [INFO ] Deduced a trap composed of 387 places in 403 ms of which 6 ms to minimize.
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 388 places in 344 ms of which 5 ms to minimize.
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 380 places in 397 ms of which 5 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 369 places in 421 ms of which 5 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 496 places in 257 ms of which 4 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 517 places in 363 ms of which 5 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 494 places in 339 ms of which 4 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 527 places in 300 ms of which 4 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 504 places in 295 ms of which 3 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 494 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:50:20] [INFO ] Deduced a trap composed of 493 places in 392 ms of which 5 ms to minimize.
[2024-05-28 16:50:21] [INFO ] Deduced a trap composed of 507 places in 312 ms of which 4 ms to minimize.
[2024-05-28 16:50:21] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 4 ms to minimize.
SMT process timed out in 21613ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21624ms
[2024-05-28 16:50:21] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:50:21] [INFO ] Invariant cache hit.
[2024-05-28 16:50:22] [INFO ] Implicit Places using invariants in 583 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 585 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 9 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22248 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:50:22] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:50:22] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:50:22] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:50:22] [INFO ] Flatten gal took : 35 ms
[2024-05-28 16:50:22] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:50:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6112976781070883751.gal : 5 ms
[2024-05-28 16:50:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4955665334248873437.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6112976781070883751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4955665334248873437.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:50:52] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:50:52] [INFO ] Applying decomposition
[2024-05-28 16:50:52] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13507418561297400018.txt' '-o' '/tmp/graph13507418561297400018.bin' '-w' '/tmp/graph13507418561297400018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13507418561297400018.bin' '-l' '-1' '-v' '-w' '/tmp/graph13507418561297400018.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:50:52] [INFO ] Decomposing Gal with order
[2024-05-28 16:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:50:52] [INFO ] Removed a total of 878 redundant transitions.
[2024-05-28 16:50:52] [INFO ] Flatten gal took : 70 ms
[2024-05-28 16:50:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2024-05-28 16:50:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9824071272555915444.gal : 15 ms
[2024-05-28 16:50:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11630907343436104739.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9824071272555915444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11630907343436104739.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 40 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:51:23] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:51:23] [INFO ] Invariant cache hit.
[2024-05-28 16:51:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 3 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:51:37] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 372 places in 282 ms of which 3 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 373 places in 284 ms of which 4 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:51:39] [INFO ] Deduced a trap composed of 369 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:51:39] [INFO ] Deduced a trap composed of 409 places in 283 ms of which 3 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 490 places in 269 ms of which 4 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 250 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 208 places in 315 ms of which 4 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 401 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 400 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 213 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 71 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 72 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 22/22 constraints]
After SMT, in 42106ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42116ms
[2024-05-28 16:52:05] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:52:05] [INFO ] Invariant cache hit.
[2024-05-28 16:52:06] [INFO ] Implicit Places using invariants in 815 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 818 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 11 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42988 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:52:06] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:52:06] [INFO ] Flatten gal took : 42 ms
[2024-05-28 16:52:06] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:52:06] [INFO ] Flatten gal took : 59 ms
[2024-05-28 16:52:06] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:52:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8971968155763782805.gal : 16 ms
[2024-05-28 16:52:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2782923551965332137.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8971968155763782805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2782923551965332137.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:52:36] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:52:36] [INFO ] Applying decomposition
[2024-05-28 16:52:36] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11486356305301326856.txt' '-o' '/tmp/graph11486356305301326856.bin' '-w' '/tmp/graph11486356305301326856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11486356305301326856.bin' '-l' '-1' '-v' '-w' '/tmp/graph11486356305301326856.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:52:36] [INFO ] Decomposing Gal with order
[2024-05-28 16:52:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:52:37] [INFO ] Removed a total of 1229 redundant transitions.
[2024-05-28 16:52:37] [INFO ] Flatten gal took : 122 ms
[2024-05-28 16:52:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 18 ms.
[2024-05-28 16:52:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality403914063899345184.gal : 10 ms
[2024-05-28 16:52:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10441646667529807741.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality403914063899345184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10441646667529807741.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 38 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 16:53:07] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:53:07] [INFO ] Invariant cache hit.
[2024-05-28 16:53:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:53:21] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 372 places in 312 ms of which 3 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 373 places in 278 ms of which 4 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 3 ms to minimize.
[2024-05-28 16:53:23] [INFO ] Deduced a trap composed of 369 places in 386 ms of which 4 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 409 places in 283 ms of which 4 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 490 places in 280 ms of which 3 ms to minimize.
[2024-05-28 16:53:24] [INFO ] Deduced a trap composed of 250 places in 269 ms of which 4 ms to minimize.
[2024-05-28 16:53:25] [INFO ] Deduced a trap composed of 208 places in 279 ms of which 3 ms to minimize.
[2024-05-28 16:53:26] [INFO ] Deduced a trap composed of 401 places in 269 ms of which 4 ms to minimize.
[2024-05-28 16:53:26] [INFO ] Deduced a trap composed of 400 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 16:53:29] [INFO ] Deduced a trap composed of 213 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 21773ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21785ms
[2024-05-28 16:53:29] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 16:53:29] [INFO ] Invariant cache hit.
[2024-05-28 16:53:29] [INFO ] Implicit Places using invariants in 529 ms returned [4, 102, 189, 273, 387, 426, 514, 565, 575, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 545 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/745 places, 1392/1405 transitions.
Applied a total of 0 rules in 8 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22380 ms. Remains : 720/745 places, 1392/1405 transitions.
[2024-05-28 16:53:29] [INFO ] Flatten gal took : 32 ms
[2024-05-28 16:53:29] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:53:29] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-28 16:53:29] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:53:29] [INFO ] Flatten gal took : 33 ms
[2024-05-28 16:53:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3753760962802326759.gal : 6 ms
[2024-05-28 16:53:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9735074748090529608.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3753760962802326759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9735074748090529608.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:53:59] [INFO ] Flatten gal took : 58 ms
[2024-05-28 16:53:59] [INFO ] Applying decomposition
[2024-05-28 16:53:59] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18134069066751121834.txt' '-o' '/tmp/graph18134069066751121834.bin' '-w' '/tmp/graph18134069066751121834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18134069066751121834.bin' '-l' '-1' '-v' '-w' '/tmp/graph18134069066751121834.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:54:00] [INFO ] Decomposing Gal with order
[2024-05-28 16:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:54:00] [INFO ] Removed a total of 1182 redundant transitions.
[2024-05-28 16:54:00] [INFO ] Flatten gal took : 95 ms
[2024-05-28 16:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 18 ms.
[2024-05-28 16:54:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1835587519763008208.gal : 8 ms
[2024-05-28 16:54:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12005709519441859880.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1835587519763008208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12005709519441859880.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 734 transition count 1396
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 734 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 732 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 732 transition count 1394
Applied a total of 24 rules in 64 ms. Remains 732 /745 variables (removed 13) and now considering 1394/1405 (removed 11) transitions.
Running 1392 sub problems to find dead transitions.
[2024-05-28 16:54:30] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
// Phase 1: matrix 1374 rows 732 cols
[2024-05-28 16:54:30] [INFO ] Computed 52 invariants in 29 ms
[2024-05-28 16:54:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-05-28 16:54:44] [INFO ] Deduced a trap composed of 126 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:54:44] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:54:44] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 0 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:54:45] [INFO ] Deduced a trap composed of 465 places in 285 ms of which 3 ms to minimize.
[2024-05-28 16:54:46] [INFO ] Deduced a trap composed of 115 places in 392 ms of which 5 ms to minimize.
[2024-05-28 16:54:46] [INFO ] Deduced a trap composed of 384 places in 365 ms of which 5 ms to minimize.
[2024-05-28 16:54:46] [INFO ] Deduced a trap composed of 426 places in 261 ms of which 4 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 411 places in 384 ms of which 5 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 64 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 2 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 390 places in 263 ms of which 4 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 407 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/2106 variables, and 70 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1392/1392 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-05-28 16:55:11] [INFO ] Deduced a trap composed of 531 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:55:11] [INFO ] Deduced a trap composed of 539 places in 299 ms of which 4 ms to minimize.
[2024-05-28 16:55:12] [INFO ] Deduced a trap composed of 502 places in 311 ms of which 8 ms to minimize.
[2024-05-28 16:55:12] [INFO ] Deduced a trap composed of 492 places in 295 ms of which 4 ms to minimize.
SMT process timed out in 42057ms, After SMT, problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 42072ms
[2024-05-28 16:55:12] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
[2024-05-28 16:55:12] [INFO ] Invariant cache hit.
[2024-05-28 16:55:13] [INFO ] Implicit Places using invariants in 622 ms returned [4, 102, 189, 273, 387, 426, 514, 566, 576, 657]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 625 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 722/745 places, 1394/1405 transitions.
Applied a total of 0 rules in 93 ms. Remains 722 /722 variables (removed 0) and now considering 1394/1394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42860 ms. Remains : 722/745 places, 1394/1405 transitions.
[2024-05-28 16:55:13] [INFO ] Flatten gal took : 34 ms
[2024-05-28 16:55:13] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:55:13] [INFO ] Input system was already deterministic with 1394 transitions.
[2024-05-28 16:55:13] [INFO ] Flatten gal took : 37 ms
[2024-05-28 16:55:13] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:55:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14584992073715375846.gal : 5 ms
[2024-05-28 16:55:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11281361827283005768.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14584992073715375846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11281361827283005768.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:55:43] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:55:43] [INFO ] Applying decomposition
[2024-05-28 16:55:43] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14308644292552185207.txt' '-o' '/tmp/graph14308644292552185207.bin' '-w' '/tmp/graph14308644292552185207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14308644292552185207.bin' '-l' '-1' '-v' '-w' '/tmp/graph14308644292552185207.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:55:43] [INFO ] Decomposing Gal with order
[2024-05-28 16:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:55:43] [INFO ] Removed a total of 1145 redundant transitions.
[2024-05-28 16:55:43] [INFO ] Flatten gal took : 74 ms
[2024-05-28 16:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 7 ms.
[2024-05-28 16:55:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2815969173362891372.gal : 6 ms
[2024-05-28 16:55:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality9431533823705937628.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2815969173362891372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9431533823705937628.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:56:14] [INFO ] Flatten gal took : 77 ms
[2024-05-28 16:56:14] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:56:14] [INFO ] Applying decomposition
[2024-05-28 16:56:14] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5988306927158657081.txt' '-o' '/tmp/graph5988306927158657081.bin' '-w' '/tmp/graph5988306927158657081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5988306927158657081.bin' '-l' '-1' '-v' '-w' '/tmp/graph5988306927158657081.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:56:14] [INFO ] Decomposing Gal with order
[2024-05-28 16:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:56:14] [INFO ] Removed a total of 1116 redundant transitions.
[2024-05-28 16:56:14] [INFO ] Flatten gal took : 118 ms
[2024-05-28 16:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 614 labels/synchronizations in 22 ms.
[2024-05-28 16:56:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10362532526457412660.gal : 9 ms
[2024-05-28 16:56:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9949239092203059852.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10362532526457412660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9949239092203059852.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 17:04:32] [INFO ] Flatten gal took : 46 ms
[2024-05-28 17:04:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14771897551140588797.gal : 9 ms
[2024-05-28 17:04:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality14548248438097200041.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14771897551140588797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14548248438097200041.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 17:13:15] [INFO ] Flatten gal took : 47 ms
[2024-05-28 17:13:15] [INFO ] Input system was already deterministic with 1405 transitions.
[2024-05-28 17:13:15] [INFO ] Transformed 745 places.
[2024-05-28 17:13:15] [INFO ] Transformed 1405 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 17:13:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality599899320903739604.gal : 6 ms
[2024-05-28 17:13:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality14480547537695737678.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality599899320903739604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14480547537695737678.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2769078 ms.
BK_STOP 1716916921882
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r290-tajo-171654446700233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 '
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 ;