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.r516-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 ltsminxred
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 r516-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 1717252477336

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:34:39] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 14:34:39] [INFO ] Transformed 752 places.
[2024-06-01 14:34:39] [INFO ] Transformed 1572 transitions.
[2024-06-01 14:34:39] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 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 118 ms. Remains 745 /752 variables (removed 7) and now considering 1405/1412 (removed 7) transitions.
Running 1403 sub problems to find dead transitions.
[2024-06-01 14:34:40] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
// Phase 1: matrix 1385 rows 745 cols
[2024-06-01 14:34:40] [INFO ] Computed 54 invariants in 198 ms
[2024-06-01 14:34:40] [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-06-01 14:34:56] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 15 ms to minimize.
[2024-06-01 14:34:56] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 1 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 64 places in 669 ms of which 2 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 64 places in 493 ms of which 1 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 67 places in 599 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 66 places in 700 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 397 places in 896 ms of which 17 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 379 places in 360 ms of which 7 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 524 places in 432 ms of which 4 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 504 places in 355 ms of which 4 ms to minimize.
SMT process timed out in 22935ms, After SMT, problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 23042ms
[2024-06-01 14:35:02] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-06-01 14:35:02] [INFO ] Invariant cache hit.
[2024-06-01 14:35:03] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 14:35:03] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-06-01 14:35:03] [INFO ] Invariant cache hit.
[2024-06-01 14:35:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:35:09] [INFO ] Implicit Places using invariants and state equation in 5950 ms returned []
Implicit Place search using SMT with State Equation took 6411 ms to find 0 implicit places.
Running 1403 sub problems to find dead transitions.
[2024-06-01 14:35:09] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-06-01 14:35:09] [INFO ] Invariant cache hit.
[2024-06-01 14:35:09] [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-06-01 14:35:23] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 5 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 386 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 457 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 391 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 396 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 354 ms of which 3 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 399 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 399 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 405 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 263 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 237 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 229 places in 276 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-06-01 14:35:31] [INFO ] Deduced a trap composed of 417 places in 296 ms of which 7 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 403 places in 327 ms of which 4 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 403 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 430 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 482 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 433 places in 352 ms of which 18 ms to minimize.
[2024-06-01 14:35:33] [INFO ] Deduced a trap composed of 388 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:35:33] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 4 ms to minimize.
[2024-06-01 14:35:33] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 214 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 395 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 429 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:35:38] [INFO ] Deduced a trap composed of 511 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:35:38] [INFO ] Deduced a trap composed of 503 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:35:41] [INFO ] Deduced a trap composed of 402 places in 303 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2130 variables, and 85 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30053 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: 35/35 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, 35/85 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-06-01 14:36:03] [INFO ] Deduced a trap composed of 254 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 405 places in 310 ms of which 6 ms to minimize.
[2024-06-01 14:36:05] [INFO ] Deduced a trap composed of 431 places in 362 ms of which 5 ms to minimize.
[2024-06-01 14:36:06] [INFO ] Deduced a trap composed of 421 places in 363 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2130 variables, and 89 constraints, problems are : Problem set: 0 solved, 1403 unsolved in 30036 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: 39/39 constraints]
After SMT, in 62002ms problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 62037ms
Starting structural reductions in LTL mode, iteration 1 : 745/752 places, 1405/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91785 ms. Remains : 745/752 places, 1405/1412 transitions.
Support contains 550 out of 745 places after structural reductions.
[2024-06-01 14:36:12] [INFO ] Flatten gal took : 260 ms
[2024-06-01 14:36:12] [INFO ] Flatten gal took : 165 ms
[2024-06-01 14:36:12] [INFO ] Input system was already deterministic with 1405 transitions.
RANDOM walk for 40000 steps (8 resets) in 3489 ms. (11 steps per ms) remains 74/100 properties
BEST_FIRST walk for 4003 steps (8 resets) in 202 ms. (19 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 264 ms. (15 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 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 78 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 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 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 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 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 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 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 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 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 145 ms. (27 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (9 resets) in 89 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 108 ms. (36 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 64 ms. (61 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 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 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 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 86 ms. (46 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 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 79 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 74/74 properties
[2024-06-01 14:36:15] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-06-01 14:36:15] [INFO ] Invariant cache hit.
[2024-06-01 14:36:15] [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
SMT process timed out in 5190ms, After SMT, problems are : Problem set: 65 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 743 transition count 1362
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 700 transition count 1359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 697 transition count 1359
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 94 place count 697 transition count 1280
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 252 place count 618 transition count 1280
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 416 place count 536 transition count 1198
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 455 place count 536 transition count 1159
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 494 place count 497 transition count 1159
Applied a total of 494 rules in 398 ms. Remains 497 /745 variables (removed 248) and now considering 1159/1405 (removed 246) transitions.
Running 1157 sub problems to find dead transitions.
[2024-06-01 14:36:21] [INFO ] Flow matrix only has 1139 transitions (discarded 20 similar events)
// Phase 1: matrix 1139 rows 497 cols
[2024-06-01 14:36:21] [INFO ] Computed 52 invariants in 39 ms
[2024-06-01 14:36:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 4 ms to minimize.
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 101 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:36:34] [INFO ] Deduced a trap composed of 336 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:36:34] [INFO ] Deduced a trap composed of 317 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:36:35] [INFO ] Deduced a trap composed of 281 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:36:37] [INFO ] Deduced a trap composed of 286 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 183 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 296 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 204 places in 227 ms of which 2 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 199 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1157 unsolved
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 274 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 2 ms to minimize.
SMT process timed out in 22795ms, After SMT, problems are : Problem set: 0 solved, 1157 unsolved
Search for dead transitions found 0 dead transitions in 22823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23224 ms. Remains : 497/745 places, 1159/1405 transitions.
RANDOM walk for 40000 steps (15 resets) in 761 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 186 ms. (213 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 60178 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 9
Probabilistic random walk after 60178 steps, saw 37788 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
[2024-06-01 14:36:48] [INFO ] Flow matrix only has 1139 transitions (discarded 20 similar events)
[2024-06-01 14:36:48] [INFO ] Invariant cache hit.
[2024-06-01 14:36:48] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/80 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 366/446 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 15/461 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 36/497 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1139/1636 variables, 497/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1636 variables, 120/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1636 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1636 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1636/1636 variables, and 669 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5212 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 497/497 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/80 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 366/446 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 252 places in 427 ms of which 3 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 246 places in 397 ms of which 3 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 253 places in 268 ms of which 2 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 261 places in 402 ms of which 7 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 232 places in 400 ms of which 6 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 246 places in 535 ms of which 3 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 253 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 256 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 245 places in 202 ms of which 15 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 252 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 243 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 247 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 252 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 259 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 265 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 256 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 258 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 253 places in 200 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 15/461 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 10 (OVERLAPS) 36/497 variables, 22/70 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 10/80 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1139/1636 variables, 497/577 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1636 variables, 120/697 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1636 variables, 6/703 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1636/1636 variables, and 703 constraints, problems are : Problem set: 5 solved, 4 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 497/497 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 28/28 constraints]
After SMT, in 50283ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1159/1159 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 497 transition count 1148
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 486 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 486 transition count 1147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 485 transition count 1147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 481 transition count 1143
Applied a total of 32 rules in 142 ms. Remains 481 /497 variables (removed 16) and now considering 1143/1159 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 481/497 places, 1143/1159 transitions.
RANDOM walk for 40001 steps (13 resets) in 911 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 128287 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 128287 steps, saw 81267 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 14:37:42] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
// Phase 1: matrix 1123 rows 481 cols
[2024-06-01 14:37:42] [INFO ] Computed 52 invariants in 13 ms
[2024-06-01 14:37:42] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 417/425 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/441 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/479 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1123/1602 variables, 479/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 120/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1602 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/1604 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1604 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1604 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1604 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1604/1604 variables, and 653 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 417/425 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 252 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 221 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 211 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 220 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 266 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 223 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 223 places in 226 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 16/441 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 38/479 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1123/1602 variables, 479/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1602 variables, 120/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1602 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:38:21] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1602 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1602 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 76510ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1143/1143 transitions.
Applied a total of 0 rules in 64 ms. Remains 481 /481 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 481/481 places, 1143/1143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1143/1143 transitions.
Applied a total of 0 rules in 58 ms. Remains 481 /481 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2024-06-01 14:38:58] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-06-01 14:38:58] [INFO ] Invariant cache hit.
[2024-06-01 14:38:59] [INFO ] Implicit Places using invariants in 626 ms returned [3, 58, 121, 172, 249, 277, 334, 365, 373, 430]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 652 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 471/481 places, 1143/1143 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 462 transition count 1134
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 462 transition count 1134
Applied a total of 18 rules in 60 ms. Remains 462 /471 variables (removed 9) and now considering 1134/1143 (removed 9) transitions.
[2024-06-01 14:38:59] [INFO ] Flow matrix only has 1114 transitions (discarded 20 similar events)
// Phase 1: matrix 1114 rows 462 cols
[2024-06-01 14:38:59] [INFO ] Computed 42 invariants in 22 ms
[2024-06-01 14:39:00] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-06-01 14:39:00] [INFO ] Flow matrix only has 1114 transitions (discarded 20 similar events)
[2024-06-01 14:39:00] [INFO ] Invariant cache hit.
[2024-06-01 14:39:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:39:08] [INFO ] Implicit Places using invariants and state equation in 8610 ms returned []
Implicit Place search using SMT with State Equation took 9463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 462/481 places, 1134/1143 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10234 ms. Remains : 462/481 places, 1134/1143 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-06-01 14:39:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 14:39:09] [INFO ] Flatten gal took : 84 ms
[2024-06-01 14:39:09] [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-06-01 14:39:09] [INFO ] Flatten gal took : 107 ms
[2024-06-01 14:39:09] [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 72 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:39:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:39:09] [INFO ] Computed 52 invariants in 14 ms
[2024-06-01 14:39:09] [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-06-01 14:39:22] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 387 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:39:24] [INFO ] Deduced a trap composed of 388 places in 288 ms of which 6 ms to minimize.
[2024-06-01 14:39:24] [INFO ] Deduced a trap composed of 380 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:39:24] [INFO ] Deduced a trap composed of 369 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:39:25] [INFO ] Deduced a trap composed of 496 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:39:25] [INFO ] Deduced a trap composed of 517 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 494 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 527 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 504 places in 281 ms of which 4 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 494 places in 281 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-06-01 14:39:29] [INFO ] Deduced a trap composed of 493 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:39:29] [INFO ] Deduced a trap composed of 507 places in 279 ms of which 16 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 226 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 221 places in 317 ms of which 4 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 216 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:39:31] [INFO ] Deduced a trap composed of 211 places in 276 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 76 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20021 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: 26/26 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, 26/76 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 76 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: 0/1390 constraints, Known Traps: 26/26 constraints]
After SMT, in 41749ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41762ms
Finished structural reductions in LTL mode , in 1 iterations and 41837 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:39:51] [INFO ] Flatten gal took : 80 ms
[2024-06-01 14:39:51] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:39:51] [INFO ] Input system was already deterministic with 1392 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 83 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:39:51] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:39:51] [INFO ] Invariant cache hit.
[2024-06-01 14:39:51] [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-06-01 14:40:06] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 372 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 373 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:40:08] [INFO ] Deduced a trap composed of 369 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:40:09] [INFO ] Deduced a trap composed of 409 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:40:09] [INFO ] Deduced a trap composed of 490 places in 342 ms of which 4 ms to minimize.
[2024-06-01 14:40:09] [INFO ] Deduced a trap composed of 250 places in 327 ms of which 4 ms to minimize.
[2024-06-01 14:40:10] [INFO ] Deduced a trap composed of 208 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 401 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 400 places in 324 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
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 20035 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-06-01 14:40:31] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:40:32] [INFO ] Deduced a trap composed of 399 places in 404 ms of which 8 ms to minimize.
[2024-06-01 14:40:33] [INFO ] Deduced a trap composed of 396 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:40:33] [INFO ] Deduced a trap composed of 403 places in 364 ms of which 7 ms to minimize.
SMT process timed out in 41795ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41821ms
Finished structural reductions in LTL mode , in 1 iterations and 41907 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:40:33] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:40:33] [INFO ] Flatten gal took : 53 ms
[2024-06-01 14:40:33] [INFO ] Input system was already deterministic with 1392 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 58 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:40:33] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:40:33] [INFO ] Invariant cache hit.
[2024-06-01 14:40:33] [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-06-01 14:40:47] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:40:47] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 372 places in 380 ms of which 3 ms to minimize.
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 373 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 369 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 409 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 490 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 250 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:40:51] [INFO ] Deduced a trap composed of 208 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:40:52] [INFO ] Deduced a trap composed of 401 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:40:53] [INFO ] Deduced a trap composed of 400 places in 400 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 20031 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-06-01 14:41:13] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 399 places in 424 ms of which 5 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 396 places in 458 ms of which 6 ms to minimize.
SMT process timed out in 41638ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41649ms
Finished structural reductions in LTL mode , in 1 iterations and 41709 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:41:15] [INFO ] Flatten gal took : 58 ms
[2024-06-01 14:41:15] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:41:15] [INFO ] Input system was already deterministic with 1392 transitions.
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 225 ms. Remains 560 /745 variables (removed 185) and now considering 1222/1405 (removed 183) transitions.
Running 1220 sub problems to find dead transitions.
[2024-06-01 14:41:16] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2024-06-01 14:41:16] [INFO ] Computed 52 invariants in 16 ms
[2024-06-01 14:41:16] [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-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 204 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 91 places in 304 ms of which 14 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 239 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 243 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 350 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:41:37] [INFO ] Deduced a trap composed of 232 places in 260 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
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 20024 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-06-01 14:41:48] [INFO ] Deduced a trap composed of 239 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:41:53] [INFO ] Deduced a trap composed of 262 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:41:53] [INFO ] Deduced a trap composed of 351 places in 214 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 10)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 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: 0/1220 constraints, Known Traps: 24/24 constraints]
After SMT, in 42298ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 42310ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42551 ms. Remains : 560/745 places, 1222/1405 transitions.
[2024-06-01 14:41:58] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:41:58] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:41:58] [INFO ] Input system was already deterministic with 1222 transitions.
RANDOM walk for 107 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 42 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:41:58] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:41:58] [INFO ] Computed 52 invariants in 14 ms
[2024-06-01 14:41:58] [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-06-01 14:42:12] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:42:13] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:42:14] [INFO ] Deduced a trap composed of 387 places in 434 ms of which 5 ms to minimize.
[2024-06-01 14:42:14] [INFO ] Deduced a trap composed of 388 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:42:14] [INFO ] Deduced a trap composed of 380 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:42:15] [INFO ] Deduced a trap composed of 369 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:42:16] [INFO ] Deduced a trap composed of 496 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:42:16] [INFO ] Deduced a trap composed of 517 places in 380 ms of which 4 ms to minimize.
[2024-06-01 14:42:17] [INFO ] Deduced a trap composed of 494 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:42:17] [INFO ] Deduced a trap composed of 527 places in 368 ms of which 5 ms to minimize.
[2024-06-01 14:42:17] [INFO ] Deduced a trap composed of 504 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:42:18] [INFO ] Deduced a trap composed of 494 places in 345 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 20024 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 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: 20/20 constraints]
After SMT, in 41800ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41811ms
Finished structural reductions in LTL mode , in 1 iterations and 41868 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:42:40] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:42:40] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:42:40] [INFO ] Input system was already deterministic with 1392 transitions.
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 2 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 2 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 116 ms. Remains 501 /745 variables (removed 244) and now considering 1163/1405 (removed 242) transitions.
Running 1161 sub problems to find dead transitions.
[2024-06-01 14:42:40] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2024-06-01 14:42:40] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 14:42:40] [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-06-01 14:42:50] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:42:50] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 108 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:42:51] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 194 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 305 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:42:52] [INFO ] Deduced a trap composed of 176 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 4 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:42:53] [INFO ] Deduced a trap composed of 37 places in 167 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-06-01 14:42:57] [INFO ] Deduced a trap composed of 317 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:42:57] [INFO ] Deduced a trap composed of 292 places in 189 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 1.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 8.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.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 0.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 6.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.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 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 6.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.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 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.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 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.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 1.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 0.0)
(s202 0.0)
(s203 1.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 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.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 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20021 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 20020 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 41719ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 41730ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41849 ms. Remains : 501/745 places, 1163/1405 transitions.
[2024-06-01 14:43:22] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:43:22] [INFO ] Flatten gal took : 63 ms
[2024-06-01 14:43:22] [INFO ] Input system was already deterministic with 1163 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 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-06-01 14:43:22] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-06-01 14:43:22] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 14:43: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-06-01 14:43:35] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:43:37] [INFO ] Deduced a trap composed of 387 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:43:37] [INFO ] Deduced a trap composed of 388 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:43:37] [INFO ] Deduced a trap composed of 380 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:43:37] [INFO ] Deduced a trap composed of 369 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:43:38] [INFO ] Deduced a trap composed of 496 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:43:39] [INFO ] Deduced a trap composed of 517 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:43:39] [INFO ] Deduced a trap composed of 494 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:43:39] [INFO ] Deduced a trap composed of 527 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:43:40] [INFO ] Deduced a trap composed of 504 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:43:40] [INFO ] Deduced a trap composed of 494 places in 280 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-06-01 14:43:42] [INFO ] Deduced a trap composed of 493 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:43:43] [INFO ] Deduced a trap composed of 507 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:43:43] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 7 ms to minimize.
[2024-06-01 14:43:44] [INFO ] Deduced a trap composed of 221 places in 381 ms of which 4 ms to minimize.
[2024-06-01 14:43:44] [INFO ] Deduced a trap composed of 216 places in 307 ms of which 4 ms to minimize.
SMT process timed out in 21744ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21758ms
Finished structural reductions in LTL mode , in 1 iterations and 21801 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:43:44] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:43:44] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:43:44] [INFO ] Input system was already deterministic with 1392 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 31 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:43:44] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:43:44] [INFO ] Invariant cache hit.
[2024-06-01 14:43:44] [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-06-01 14:43:58] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:43:59] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:44:00] [INFO ] Deduced a trap composed of 372 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:44:00] [INFO ] Deduced a trap composed of 373 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:44:00] [INFO ] Deduced a trap composed of 98 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:44:01] [INFO ] Deduced a trap composed of 369 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:44:01] [INFO ] Deduced a trap composed of 409 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 490 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 208 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:44:04] [INFO ] Deduced a trap composed of 401 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:44:04] [INFO ] Deduced a trap composed of 400 places in 325 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.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 0.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 0.0)
(s45 5.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 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.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 0.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 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.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 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.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 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 5.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 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.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 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.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 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.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 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.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 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.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 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.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)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.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 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.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)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.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 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 5.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 (/ 1.0 3.0))
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 9.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20022 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-06-01 14:44:23] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 4 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 399 places in 378 ms of which 4 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 396 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:44:25] [INFO ] Deduced a trap composed of 403 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:44:26] [INFO ] Deduced a trap composed of 509 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:44:26] [INFO ] Deduced a trap composed of 532 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 76 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: 0/1390 constraints, Known Traps: 26/26 constraints]
After SMT, in 42071ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42082ms
Finished structural reductions in LTL mode , in 1 iterations and 42116 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:44:26] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:44:26] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:44:26] [INFO ] Input system was already deterministic with 1392 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 28 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:44:26] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:44:26] [INFO ] Invariant cache hit.
[2024-06-01 14:44:26] [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-06-01 14:44:41] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 372 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 373 places in 304 ms of which 5 ms to minimize.
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 98 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 369 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 409 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 490 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 208 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 401 places in 317 ms of which 4 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 400 places in 304 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
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 20022 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-06-01 14:45:07] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 71 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: 0/1390 constraints, Known Traps: 21/21 constraints]
After SMT, in 41446ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41458ms
Finished structural reductions in LTL mode , in 1 iterations and 41489 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-06-01 14:45:08] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:45:08] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:45:08] [INFO ] Input system was already deterministic with 1392 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 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 44 ms. Remains 732 /745 variables (removed 13) and now considering 1394/1405 (removed 11) transitions.
Running 1392 sub problems to find dead transitions.
[2024-06-01 14:45:08] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
// Phase 1: matrix 1374 rows 732 cols
[2024-06-01 14:45:08] [INFO ] Computed 52 invariants in 17 ms
[2024-06-01 14:45:08] [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-06-01 14:45:21] [INFO ] Deduced a trap composed of 126 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 465 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 115 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 384 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 426 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:45:24] [INFO ] Deduced a trap composed of 411 places in 365 ms of which 5 ms to minimize.
[2024-06-01 14:45:24] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:45:26] [INFO ] Deduced a trap composed of 390 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:45:27] [INFO ] Deduced a trap composed of 407 places in 281 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-06-01 14:45:30] [INFO ] Deduced a trap composed of 502 places in 488 ms of which 5 ms to minimize.
SMT process timed out in 21534ms, After SMT, problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 21569ms
Finished structural reductions in LTL mode , in 1 iterations and 21618 ms. Remains : 732/745 places, 1394/1405 transitions.
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:45:30] [INFO ] Input system was already deterministic with 1394 transitions.
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:45:30] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:45:30] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:45:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 745 places, 1405 transitions and 6128 arcs took 7 ms.
Total runtime 651459 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-CTLCardinality-2024-13

BK_STOP 1717253130750

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1736/ctl_0_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1736/ctl_1_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1736/ctl_2_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1736/ctl_3_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1736/ctl_4_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1736/ctl_5_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1736/ctl_6_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1736/ctl_7_
ctl formula name PolyORBLF-PT-S02J04T10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1736/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r516-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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;