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.r289-tajo-171654445500225.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 greatspnxred
Input is PolyORBLF-PT-S02J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 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 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 717K 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-S02J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716859474303

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:24:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 01:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:24:36] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-28 01:24:36] [INFO ] Transformed 614 places.
[2024-05-28 01:24:36] [INFO ] Transformed 1242 transitions.
[2024-05-28 01:24:36] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 356 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 110 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 01:24:36] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-28 01:24:36] [INFO ] Computed 48 invariants in 66 ms
[2024-05-28 01:24:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 01:24:52] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 54 ms to minimize.
[2024-05-28 01:24:55] [INFO ] Deduced a trap composed of 67 places in 2523 ms of which 3 ms to minimize.
[2024-05-28 01:24:55] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 3 ms to minimize.
[2024-05-28 01:24:55] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 15 ms to minimize.
[2024-05-28 01:24:55] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:24:55] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-28 01:24:56] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-28 01:24:56] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 8 ms to minimize.
[2024-05-28 01:24:56] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
[2024-05-28 01:24:57] [INFO ] Deduced a trap composed of 175 places in 410 ms of which 33 ms to minimize.
[2024-05-28 01:24:57] [INFO ] Deduced a trap composed of 325 places in 416 ms of which 8 ms to minimize.
[2024-05-28 01:24:58] [INFO ] Deduced a trap composed of 310 places in 370 ms of which 4 ms to minimize.
[2024-05-28 01:24:58] [INFO ] Deduced a trap composed of 54 places in 454 ms of which 19 ms to minimize.
SMT process timed out in 22375ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 22436ms
[2024-05-28 01:24:58] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 01:24:58] [INFO ] Invariant cache hit.
[2024-05-28 01:24:59] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-28 01:24:59] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 01:24:59] [INFO ] Invariant cache hit.
[2024-05-28 01:25:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:25:08] [INFO ] Implicit Places using invariants and state equation in 8787 ms returned []
Implicit Place search using SMT with State Equation took 9441 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-05-28 01:25:08] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 01:25:08] [INFO ] Invariant cache hit.
[2024-05-28 01:25:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
SMT process timed out in 31621ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 31657ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63736 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 356 out of 612 places after structural reductions.
[2024-05-28 01:25:40] [INFO ] Flatten gal took : 212 ms
[2024-05-28 01:25:40] [INFO ] Flatten gal took : 108 ms
[2024-05-28 01:25:41] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 333 out of 612 places (down from 356) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 2993 ms. (13 steps per ms) remains 44/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 67 ms. (58 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 68 ms. (57 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 46 ms. (85 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (8 resets) in 68 ms. (57 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 79 ms. (50 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (9 resets) in 72 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (9 resets) in 66 ms. (59 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (9 resets) in 61 ms. (64 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (8 resets) in 83 ms. (47 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
[2024-05-28 01:25:43] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 01:25:43] [INFO ] Invariant cache hit.
[2024-05-28 01:25:43] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/322 variables, 13/13 constraints. Problems are: Problem set: 11 solved, 33 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 1/14 constraints. Problems are: Problem set: 12 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/14 constraints. Problems are: Problem set: 12 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 4 (OVERLAPS) 289/611 variables, 33/47 constraints. Problems are: Problem set: 38 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 0/47 constraints. Problems are: Problem set: 38 solved, 6 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/612 variables, 1/48 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/48 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1098/1710 variables, 612/660 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1710 variables, 96/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 756 constraints, problems are : Problem set: 39 solved, 5 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/122 variables, 3/3 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/126 variables, 2/5 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 460/586 variables, 22/27 constraints. Problems are: Problem set: 39 solved, 5 unsolved
[2024-05-28 01:25:49] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:25:49] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:25:49] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:25:49] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:25:50] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 1 ms to minimize.
[2024-05-28 01:25:50] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:25:50] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2024-05-28 01:25:50] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:25:50] [INFO ] Deduced a trap composed of 370 places in 402 ms of which 4 ms to minimize.
[2024-05-28 01:25:51] [INFO ] Deduced a trap composed of 377 places in 280 ms of which 5 ms to minimize.
[2024-05-28 01:25:51] [INFO ] Deduced a trap composed of 375 places in 312 ms of which 3 ms to minimize.
[2024-05-28 01:25:51] [INFO ] Deduced a trap composed of 312 places in 311 ms of which 4 ms to minimize.
[2024-05-28 01:25:52] [INFO ] Deduced a trap composed of 312 places in 480 ms of which 32 ms to minimize.
[2024-05-28 01:25:52] [INFO ] Deduced a trap composed of 293 places in 326 ms of which 4 ms to minimize.
[2024-05-28 01:25:53] [INFO ] Deduced a trap composed of 353 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:25:53] [INFO ] Deduced a trap composed of 352 places in 401 ms of which 8 ms to minimize.
[2024-05-28 01:25:53] [INFO ] Deduced a trap composed of 366 places in 415 ms of which 7 ms to minimize.
SMT process timed out in 10074ms, After SMT, problems are : Problem set: 39 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 612 transition count 1073
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 571 transition count 1072
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 570 transition count 1072
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 84 place count 570 transition count 999
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 230 place count 497 transition count 999
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 238 place count 489 transition count 991
Iterating global reduction 3 with 8 rules applied. Total rules applied 246 place count 489 transition count 991
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 338 place count 443 transition count 945
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 443 transition count 937
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 435 transition count 937
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 363 place count 435 transition count 937
Applied a total of 363 rules in 388 ms. Remains 435 /612 variables (removed 177) and now considering 937/1114 (removed 177) transitions.
Running 935 sub problems to find dead transitions.
[2024-05-28 01:25:54] [INFO ] Flow matrix only has 921 transitions (discarded 16 similar events)
// Phase 1: matrix 921 rows 435 cols
[2024-05-28 01:25:54] [INFO ] Computed 48 invariants in 18 ms
[2024-05-28 01:25:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 935 unsolved
[2024-05-28 01:26:03] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:26:03] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2024-05-28 01:26:03] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-28 01:26:03] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-28 01:26:03] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 9 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 78 places in 351 ms of which 3 ms to minimize.
[2024-05-28 01:26:04] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:26:05] [INFO ] Deduced a trap composed of 200 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:26:06] [INFO ] Deduced a trap composed of 207 places in 226 ms of which 3 ms to minimize.
[2024-05-28 01:26:06] [INFO ] Deduced a trap composed of 169 places in 385 ms of which 3 ms to minimize.
[2024-05-28 01:26:06] [INFO ] Deduced a trap composed of 158 places in 323 ms of which 3 ms to minimize.
[2024-05-28 01:26:06] [INFO ] Deduced a trap composed of 157 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:26:07] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 3 ms to minimize.
[2024-05-28 01:26:09] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 4 ms to minimize.
[2024-05-28 01:26:10] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 4 ms to minimize.
[2024-05-28 01:26:11] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 935 unsolved
[2024-05-28 01:26:12] [INFO ] Deduced a trap composed of 193 places in 266 ms of which 4 ms to minimize.
[2024-05-28 01:26:13] [INFO ] Deduced a trap composed of 157 places in 262 ms of which 3 ms to minimize.
[2024-05-28 01:26:14] [INFO ] Deduced a trap composed of 141 places in 274 ms of which 3 ms to minimize.
[2024-05-28 01:26:15] [INFO ] Deduced a trap composed of 209 places in 252 ms of which 4 ms to minimize.
[2024-05-28 01:26:15] [INFO ] Deduced a trap composed of 257 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/1356 variables, and 71 constraints, problems are : Problem set: 0 solved, 935 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/435 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 935/935 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 25/71 constraints. Problems are: Problem set: 0 solved, 935 unsolved
[2024-05-28 01:26:23] [INFO ] Deduced a trap composed of 170 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:26:29] [INFO ] Deduced a trap composed of 151 places in 252 ms of which 7 ms to minimize.
[2024-05-28 01:26:30] [INFO ] Deduced a trap composed of 193 places in 258 ms of which 3 ms to minimize.
[2024-05-28 01:26:30] [INFO ] Deduced a trap composed of 182 places in 220 ms of which 3 ms to minimize.
[2024-05-28 01:26:31] [INFO ] Deduced a trap composed of 201 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:26:31] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 3 ms to minimize.
[2024-05-28 01:26:31] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/1356 variables, and 78 constraints, problems are : Problem set: 0 solved, 935 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/435 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/935 constraints, Known Traps: 32/32 constraints]
After SMT, in 41863ms problems are : Problem set: 0 solved, 935 unsolved
Search for dead transitions found 0 dead transitions in 41875ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42280 ms. Remains : 435/612 places, 937/1114 transitions.
RANDOM walk for 40000 steps (17 resets) in 924 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 438 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (13 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (10 resets) in 436 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 111681 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 5
Probabilistic random walk after 111681 steps, saw 65142 distinct states, run finished after 3021 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-28 01:26:40] [INFO ] Flow matrix only has 921 transitions (discarded 16 similar events)
[2024-05-28 01:26:40] [INFO ] Invariant cache hit.
[2024-05-28 01:26:40] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/111 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 298/409 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/418 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 15/433 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 921/1354 variables, 433/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1354 variables, 96/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1354 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/1356 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1356 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1356 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1356 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1356/1356 variables, and 579 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 435/435 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 64/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/111 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 298/409 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 01:26:42] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-28 01:26:42] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 3 ms to minimize.
[2024-05-28 01:26:42] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-28 01:26:42] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-05-28 01:26:43] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-28 01:26:43] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:26:43] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 3 ms to minimize.
[2024-05-28 01:26:43] [INFO ] Deduced a trap composed of 207 places in 250 ms of which 3 ms to minimize.
[2024-05-28 01:26:43] [INFO ] Deduced a trap composed of 215 places in 236 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 01:26:44] [INFO ] Deduced a trap composed of 212 places in 231 ms of which 3 ms to minimize.
[2024-05-28 01:26:44] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:26:44] [INFO ] Deduced a trap composed of 218 places in 247 ms of which 3 ms to minimize.
[2024-05-28 01:26:44] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-05-28 01:26:45] [INFO ] Deduced a trap composed of 179 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:26:45] [INFO ] Deduced a trap composed of 213 places in 196 ms of which 3 ms to minimize.
[2024-05-28 01:26:45] [INFO ] Deduced a trap composed of 213 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:26:45] [INFO ] Deduced a trap composed of 219 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:26:46] [INFO ] Deduced a trap composed of 192 places in 230 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 9/418 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 11 (OVERLAPS) 15/433 variables, 11/65 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 921/1354 variables, 433/498 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1354 variables, 96/594 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1354 variables, 3/597 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1354 variables, 0/597 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1356 variables, 2/599 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1356 variables, 1/600 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1356 variables, 0/600 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1356 variables, 0/600 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1356/1356 variables, and 600 constraints, problems are : Problem set: 2 solved, 3 unsolved in 20249 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 435/435 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 22287ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1796 ms.
Support contains 7 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 435 transition count 929
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 427 transition count 929
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 427 transition count 928
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 426 transition count 928
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 54 place count 408 transition count 910
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 408 transition count 902
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 400 transition count 902
Applied a total of 70 rules in 108 ms. Remains 400 /435 variables (removed 35) and now considering 902/937 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 400/435 places, 902/937 transitions.
RANDOM walk for 40000 steps (30 resets) in 433 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 124101 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 3
Probabilistic random walk after 124101 steps, saw 73568 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 01:27:07] [INFO ] Flow matrix only has 886 transitions (discarded 16 similar events)
// Phase 1: matrix 886 rows 400 cols
[2024-05-28 01:27:07] [INFO ] Computed 48 invariants in 51 ms
[2024-05-28 01:27:07] [INFO ] State equation strengthened by 96 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 314/350 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/366 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 32/398 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 886/1284 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1284 variables, 96/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1284 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1286 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1286 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1286 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1286/1286 variables, and 544 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 400/400 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 314/350 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/366 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:27:10] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-05-28 01:27:11] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:27:11] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 3 ms to minimize.
[2024-05-28 01:27:11] [INFO ] Deduced a trap composed of 210 places in 306 ms of which 5 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 32/398 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:27:12] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 886/1284 variables, 398/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1284 variables, 96/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1284 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1284 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1286 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1286 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:27:18] [INFO ] Deduced a trap composed of 173 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:27:19] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1286 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1286 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1286 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1286/1286 variables, and 560 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9288 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 400/400 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 11748ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1159 ms.
Support contains 7 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 902/902 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 400/400 places, 902/902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 902/902 transitions.
Applied a total of 0 rules in 16 ms. Remains 400 /400 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-28 01:27:20] [INFO ] Flow matrix only has 886 transitions (discarded 16 similar events)
[2024-05-28 01:27:20] [INFO ] Invariant cache hit.
[2024-05-28 01:27:21] [INFO ] Implicit Places using invariants in 479 ms returned [71, 117, 191, 199, 271, 314, 338, 346]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 483 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/400 places, 902/902 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 386 transition count 896
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 386 transition count 896
Applied a total of 12 rules in 21 ms. Remains 386 /392 variables (removed 6) and now considering 896/902 (removed 6) transitions.
[2024-05-28 01:27:21] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
// Phase 1: matrix 880 rows 386 cols
[2024-05-28 01:27:21] [INFO ] Computed 40 invariants in 14 ms
[2024-05-28 01:27:21] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-28 01:27:21] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-05-28 01:27:21] [INFO ] Invariant cache hit.
[2024-05-28 01:27:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:27:27] [INFO ] Implicit Places using invariants and state equation in 5514 ms returned []
Implicit Place search using SMT with State Equation took 6004 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 386/400 places, 896/902 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6526 ms. Remains : 386/400 places, 896/902 transitions.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 01:27:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 01:27:27] [INFO ] Flatten gal took : 136 ms
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 01:27:27] [INFO ] Flatten gal took : 125 ms
[2024-05-28 01:27:27] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 69 out of 612 places (down from 80) after GAL structural reductions.
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 540 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 412 transition count 914
Applied a total of 400 rules in 138 ms. Remains 412 /612 variables (removed 200) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2024-05-28 01:27:28] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-05-28 01:27:28] [INFO ] Computed 48 invariants in 21 ms
[2024-05-28 01:27:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 912 unsolved
SMT process timed out in 21301ms, After SMT, problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 21319ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21474 ms. Remains : 412/612 places, 914/1114 transitions.
[2024-05-28 01:27:49] [INFO ] Flatten gal took : 57 ms
[2024-05-28 01:27:49] [INFO ] Flatten gal took : 35 ms
[2024-05-28 01:27:49] [INFO ] Input system was already deterministic with 914 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 29 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-05-28 01:27:49] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-05-28 01:27:49] [INFO ] Computed 48 invariants in 28 ms
[2024-05-28 01:27:49] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:28:01] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:28:02] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:28:02] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 5 ms to minimize.
[2024-05-28 01:28:02] [INFO ] Deduced a trap composed of 370 places in 296 ms of which 4 ms to minimize.
[2024-05-28 01:28:03] [INFO ] Deduced a trap composed of 291 places in 295 ms of which 4 ms to minimize.
[2024-05-28 01:28:03] [INFO ] Deduced a trap composed of 414 places in 290 ms of which 4 ms to minimize.
[2024-05-28 01:28:04] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:28:05] [INFO ] Deduced a trap composed of 319 places in 262 ms of which 3 ms to minimize.
[2024-05-28 01:28:05] [INFO ] Deduced a trap composed of 269 places in 319 ms of which 5 ms to minimize.
[2024-05-28 01:28:06] [INFO ] Deduced a trap composed of 291 places in 283 ms of which 4 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 4 ms to minimize.
[2024-05-28 01:28:08] [INFO ] Deduced a trap composed of 54 places in 355 ms of which 4 ms to minimize.
[2024-05-28 01:28:09] [INFO ] Deduced a trap composed of 322 places in 344 ms of which 4 ms to minimize.
[2024-05-28 01:28:09] [INFO ] Deduced a trap composed of 299 places in 323 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 01:28:24] [INFO ] Deduced a trap composed of 295 places in 312 ms of which 5 ms to minimize.
[2024-05-28 01:28:24] [INFO ] Deduced a trap composed of 311 places in 302 ms of which 5 ms to minimize.
[2024-05-28 01:28:28] [INFO ] Deduced a trap composed of 295 places in 277 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1694 variables, and 69 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 23/23 constraints]
After SMT, in 41407ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41435ms
Finished structural reductions in LTL mode , in 1 iterations and 41467 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-05-28 01:28:31] [INFO ] Flatten gal took : 52 ms
[2024-05-28 01:28:31] [INFO ] Flatten gal took : 50 ms
[2024-05-28 01:28:31] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 612 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 556 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 548 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 128 place count 548 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 352 place count 436 transition count 938
Applied a total of 352 rules in 90 ms. Remains 436 /612 variables (removed 176) and now considering 938/1114 (removed 176) transitions.
Running 936 sub problems to find dead transitions.
[2024-05-28 01:28:31] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 436 cols
[2024-05-28 01:28:31] [INFO ] Computed 48 invariants in 12 ms
[2024-05-28 01:28:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:28:39] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-05-28 01:28:40] [INFO ] Deduced a trap composed of 89 places in 251 ms of which 4 ms to minimize.
[2024-05-28 01:28:40] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:28:40] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 3 ms to minimize.
[2024-05-28 01:28:40] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-28 01:28:41] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 3 ms to minimize.
[2024-05-28 01:28:41] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:28:42] [INFO ] Deduced a trap composed of 260 places in 233 ms of which 2 ms to minimize.
[2024-05-28 01:28:42] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 2 ms to minimize.
[2024-05-28 01:28:43] [INFO ] Deduced a trap composed of 156 places in 263 ms of which 3 ms to minimize.
[2024-05-28 01:28:44] [INFO ] Deduced a trap composed of 159 places in 234 ms of which 3 ms to minimize.
[2024-05-28 01:28:44] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 01:28:44] [INFO ] Deduced a trap composed of 149 places in 332 ms of which 5 ms to minimize.
[2024-05-28 01:28:44] [INFO ] Deduced a trap composed of 162 places in 310 ms of which 7 ms to minimize.
[2024-05-28 01:28:47] [INFO ] Deduced a trap composed of 270 places in 295 ms of which 6 ms to minimize.
[2024-05-28 01:28:51] [INFO ] Deduced a trap composed of 265 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1358 variables, and 66 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 01:29:06] [INFO ] Deduced a trap composed of 190 places in 283 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1358 variables, and 67 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 21/21 constraints]
After SMT, in 41474ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41484ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41577 ms. Remains : 436/612 places, 938/1114 transitions.
[2024-05-28 01:29:13] [INFO ] Flatten gal took : 50 ms
[2024-05-28 01:29:13] [INFO ] Flatten gal took : 65 ms
[2024-05-28 01:29:13] [INFO ] Input system was already deterministic with 938 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 605 transition count 1107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 605 transition count 1107
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 598 transition count 1100
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 598 transition count 1100
Applied a total of 28 rules in 24 ms. Remains 598 /612 variables (removed 14) and now considering 1100/1114 (removed 14) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 01:29:13] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 598 cols
[2024-05-28 01:29:13] [INFO ] Computed 48 invariants in 19 ms
[2024-05-28 01:29:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 9 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:29:24] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 3 ms to minimize.
[2024-05-28 01:29:25] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2024-05-28 01:29:25] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:29:25] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:29:26] [INFO ] Deduced a trap composed of 164 places in 396 ms of which 6 ms to minimize.
[2024-05-28 01:29:26] [INFO ] Deduced a trap composed of 408 places in 347 ms of which 4 ms to minimize.
[2024-05-28 01:29:28] [INFO ] Deduced a trap composed of 346 places in 387 ms of which 5 ms to minimize.
[2024-05-28 01:29:28] [INFO ] Deduced a trap composed of 203 places in 194 ms of which 2 ms to minimize.
[2024-05-28 01:29:29] [INFO ] Deduced a trap composed of 321 places in 340 ms of which 4 ms to minimize.
[2024-05-28 01:29:29] [INFO ] Deduced a trap composed of 323 places in 370 ms of which 5 ms to minimize.
[2024-05-28 01:29:29] [INFO ] Deduced a trap composed of 329 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:29:30] [INFO ] Deduced a trap composed of 441 places in 299 ms of which 4 ms to minimize.
[2024-05-28 01:29:30] [INFO ] Deduced a trap composed of 304 places in 281 ms of which 3 ms to minimize.
[2024-05-28 01:29:30] [INFO ] Deduced a trap composed of 300 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:29:31] [INFO ] Deduced a trap composed of 269 places in 419 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.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 1.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 0.0)
(s57 0.0)
(s58 (/ 35.0 4.0))
(s59 0.0)
(s60 0.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 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.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 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 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1682 variables, and 66 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/598 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 01:29:44] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 4 ms to minimize.
[2024-05-28 01:29:45] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:29:49] [INFO ] Deduced a trap composed of 289 places in 329 ms of which 3 ms to minimize.
[2024-05-28 01:29:50] [INFO ] Deduced a trap composed of 295 places in 422 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/1682 variables, and 70 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/598 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 24/24 constraints]
After SMT, in 41416ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 41434ms
Finished structural reductions in LTL mode , in 1 iterations and 41462 ms. Remains : 598/612 places, 1100/1114 transitions.
[2024-05-28 01:29:54] [INFO ] Flatten gal took : 41 ms
[2024-05-28 01:29:54] [INFO ] Flatten gal took : 44 ms
[2024-05-28 01:29:54] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 25 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:29:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 01:29:54] [INFO ] Computed 48 invariants in 28 ms
[2024-05-28 01:29:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:30:05] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 6 ms to minimize.
[2024-05-28 01:30:05] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-28 01:30:05] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:30:05] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:30:06] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:30:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:30:06] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 2 ms to minimize.
[2024-05-28 01:30:06] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:30:06] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:30:07] [INFO ] Deduced a trap composed of 303 places in 447 ms of which 6 ms to minimize.
[2024-05-28 01:30:07] [INFO ] Deduced a trap composed of 168 places in 355 ms of which 5 ms to minimize.
[2024-05-28 01:30:08] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 4 ms to minimize.
[2024-05-28 01:30:09] [INFO ] Deduced a trap composed of 308 places in 455 ms of which 7 ms to minimize.
[2024-05-28 01:30:09] [INFO ] Deduced a trap composed of 303 places in 389 ms of which 5 ms to minimize.
[2024-05-28 01:30:11] [INFO ] Deduced a trap composed of 287 places in 356 ms of which 5 ms to minimize.
[2024-05-28 01:30:11] [INFO ] Deduced a trap composed of 283 places in 372 ms of which 5 ms to minimize.
[2024-05-28 01:30:14] [INFO ] Deduced a trap composed of 392 places in 447 ms of which 6 ms to minimize.
[2024-05-28 01:30:14] [INFO ] Deduced a trap composed of 71 places in 397 ms of which 5 ms to minimize.
[2024-05-28 01:30:15] [INFO ] Deduced a trap composed of 305 places in 430 ms of which 4 ms to minimize.
[2024-05-28 01:30:16] [INFO ] Deduced a trap composed of 294 places in 432 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:30:34] [INFO ] Deduced a trap composed of 364 places in 316 ms of which 4 ms to minimize.
[2024-05-28 01:30:34] [INFO ] Deduced a trap composed of 357 places in 264 ms of which 3 ms to minimize.
[2024-05-28 01:30:35] [INFO ] Deduced a trap composed of 353 places in 285 ms of which 3 ms to minimize.
[2024-05-28 01:30:35] [INFO ] Deduced a trap composed of 383 places in 276 ms of which 3 ms to minimize.
[2024-05-28 01:30:36] [INFO ] Deduced a trap composed of 394 places in 258 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41516ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41526ms
Finished structural reductions in LTL mode , in 1 iterations and 41555 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-28 01:30:36] [INFO ] Flatten gal took : 59 ms
[2024-05-28 01:30:36] [INFO ] Flatten gal took : 47 ms
[2024-05-28 01:30:36] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 612 transition count 1043
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 541 transition count 1042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 144 place count 540 transition count 980
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 268 place count 478 transition count 980
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 394 place count 415 transition count 917
Applied a total of 394 rules in 63 ms. Remains 415 /612 variables (removed 197) and now considering 917/1114 (removed 197) transitions.
Running 915 sub problems to find dead transitions.
[2024-05-28 01:30:36] [INFO ] Flow matrix only has 901 transitions (discarded 16 similar events)
// Phase 1: matrix 901 rows 415 cols
[2024-05-28 01:30:36] [INFO ] Computed 48 invariants in 12 ms
[2024-05-28 01:30:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 915 unsolved
[2024-05-28 01:30:42] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 3 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:30:43] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:30:44] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-28 01:30:44] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:30:44] [INFO ] Deduced a trap composed of 236 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:30:44] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 144 places in 249 ms of which 3 ms to minimize.
[2024-05-28 01:30:47] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:30:49] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:30:51] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 3 ms to minimize.
[2024-05-28 01:30:52] [INFO ] Deduced a trap composed of 135 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:30:52] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:30:53] [INFO ] Deduced a trap composed of 250 places in 196 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/1316 variables, and 66 constraints, problems are : Problem set: 0 solved, 915 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/415 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 915/915 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 915 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 915 unsolved
[2024-05-28 01:31:09] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-28 01:31:14] [INFO ] Deduced a trap composed of 134 places in 221 ms of which 4 ms to minimize.
[2024-05-28 01:31:16] [INFO ] Deduced a trap composed of 163 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/1316 variables, and 69 constraints, problems are : Problem set: 0 solved, 915 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/415 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/915 constraints, Known Traps: 23/23 constraints]
After SMT, in 41230ms problems are : Problem set: 0 solved, 915 unsolved
Search for dead transitions found 0 dead transitions in 41240ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41307 ms. Remains : 415/612 places, 917/1114 transitions.
[2024-05-28 01:31:18] [INFO ] Flatten gal took : 52 ms
[2024-05-28 01:31:18] [INFO ] Flatten gal took : 44 ms
[2024-05-28 01:31:18] [INFO ] Input system was already deterministic with 917 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 25 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:31:18] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 01:31:18] [INFO ] Computed 48 invariants in 16 ms
[2024-05-28 01:31:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:31:28] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:31:28] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:31:28] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:31:28] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:31:28] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:31:29] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-05-28 01:31:29] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:31:29] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:31:29] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:31:29] [INFO ] Deduced a trap composed of 303 places in 334 ms of which 4 ms to minimize.
[2024-05-28 01:31:30] [INFO ] Deduced a trap composed of 168 places in 666 ms of which 4 ms to minimize.
[2024-05-28 01:31:31] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:31:32] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 4 ms to minimize.
[2024-05-28 01:31:32] [INFO ] Deduced a trap composed of 303 places in 461 ms of which 7 ms to minimize.
[2024-05-28 01:31:33] [INFO ] Deduced a trap composed of 287 places in 356 ms of which 5 ms to minimize.
[2024-05-28 01:31:34] [INFO ] Deduced a trap composed of 283 places in 267 ms of which 4 ms to minimize.
[2024-05-28 01:31:36] [INFO ] Deduced a trap composed of 392 places in 361 ms of which 5 ms to minimize.
[2024-05-28 01:31:36] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 3 ms to minimize.
[2024-05-28 01:31:37] [INFO ] Deduced a trap composed of 305 places in 379 ms of which 3 ms to minimize.
[2024-05-28 01:31:38] [INFO ] Deduced a trap composed of 294 places in 341 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:31:56] [INFO ] Deduced a trap composed of 364 places in 297 ms of which 5 ms to minimize.
[2024-05-28 01:31:56] [INFO ] Deduced a trap composed of 357 places in 274 ms of which 4 ms to minimize.
[2024-05-28 01:31:57] [INFO ] Deduced a trap composed of 353 places in 287 ms of which 5 ms to minimize.
[2024-05-28 01:31:58] [INFO ] Deduced a trap composed of 383 places in 306 ms of which 3 ms to minimize.
[2024-05-28 01:31:58] [INFO ] Deduced a trap composed of 394 places in 271 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41200ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41211ms
Finished structural reductions in LTL mode , in 1 iterations and 41238 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-28 01:31:59] [INFO ] Flatten gal took : 41 ms
[2024-05-28 01:31:59] [INFO ] Flatten gal took : 40 ms
[2024-05-28 01:31:59] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 142 place count 541 transition count 979
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 398 place count 413 transition count 915
Applied a total of 398 rules in 74 ms. Remains 413 /612 variables (removed 199) and now considering 915/1114 (removed 199) transitions.
Running 913 sub problems to find dead transitions.
[2024-05-28 01:31:59] [INFO ] Flow matrix only has 899 transitions (discarded 16 similar events)
// Phase 1: matrix 899 rows 413 cols
[2024-05-28 01:31:59] [INFO ] Computed 48 invariants in 13 ms
[2024-05-28 01:31:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-05-28 01:32:06] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-28 01:32:06] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:32:06] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:32:07] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:32:07] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:32:07] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 3 ms to minimize.
[2024-05-28 01:32:07] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:32:07] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:32:08] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:32:08] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
[2024-05-28 01:32:08] [INFO ] Deduced a trap composed of 155 places in 248 ms of which 3 ms to minimize.
[2024-05-28 01:32:09] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 3 ms to minimize.
[2024-05-28 01:32:09] [INFO ] Deduced a trap composed of 143 places in 253 ms of which 3 ms to minimize.
[2024-05-28 01:32:11] [INFO ] Deduced a trap composed of 235 places in 220 ms of which 2 ms to minimize.
[2024-05-28 01:32:12] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 149 places in 248 ms of which 3 ms to minimize.
[2024-05-28 01:32:17] [INFO ] Deduced a trap composed of 174 places in 255 ms of which 3 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 154 places in 259 ms of which 3 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 3 ms to minimize.
[2024-05-28 01:32:18] [INFO ] Deduced a trap composed of 150 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1312 variables, and 66 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/1312 variables, and 66 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/913 constraints, Known Traps: 20/20 constraints]
After SMT, in 41595ms problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 41604ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41683 ms. Remains : 413/612 places, 915/1114 transitions.
[2024-05-28 01:32:41] [INFO ] Flatten gal took : 28 ms
[2024-05-28 01:32:41] [INFO ] Flatten gal took : 29 ms
[2024-05-28 01:32:41] [INFO ] Input system was already deterministic with 915 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 50 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 01:32:41] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 01:32:41] [INFO ] Computed 48 invariants in 20 ms
[2024-05-28 01:32:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:32:52] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-05-28 01:32:52] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 5 ms to minimize.
[2024-05-28 01:32:52] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:32:52] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:32:53] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:32:53] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:32:53] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:32:53] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:32:53] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:32:54] [INFO ] Deduced a trap composed of 303 places in 326 ms of which 5 ms to minimize.
[2024-05-28 01:32:54] [INFO ] Deduced a trap composed of 168 places in 347 ms of which 4 ms to minimize.
[2024-05-28 01:32:55] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 2 ms to minimize.
[2024-05-28 01:32:56] [INFO ] Deduced a trap composed of 308 places in 331 ms of which 5 ms to minimize.
[2024-05-28 01:32:56] [INFO ] Deduced a trap composed of 303 places in 305 ms of which 4 ms to minimize.
[2024-05-28 01:32:57] [INFO ] Deduced a trap composed of 287 places in 313 ms of which 4 ms to minimize.
[2024-05-28 01:32:57] [INFO ] Deduced a trap composed of 283 places in 270 ms of which 3 ms to minimize.
[2024-05-28 01:32:59] [INFO ] Deduced a trap composed of 392 places in 323 ms of which 5 ms to minimize.
[2024-05-28 01:33:00] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 3 ms to minimize.
[2024-05-28 01:33:00] [INFO ] Deduced a trap composed of 305 places in 312 ms of which 4 ms to minimize.
[2024-05-28 01:33:01] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
(s429 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 9.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 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 8.0)
(s59 1.0)
(s60 0.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 1.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 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.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 1.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 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.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 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 2.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 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.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)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 10.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 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.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 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(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 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 (/ 1.0 3.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 01:33:19] [INFO ] Deduced a trap composed of 364 places in 286 ms of which 4 ms to minimize.
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 357 places in 264 ms of which 4 ms to minimize.
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 353 places in 252 ms of which 4 ms to minimize.
[2024-05-28 01:33:21] [INFO ] Deduced a trap composed of 383 places in 332 ms of which 4 ms to minimize.
[2024-05-28 01:33:21] [INFO ] Deduced a trap composed of 394 places in 288 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 71 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 25/25 constraints]
After SMT, in 41333ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41347ms
Finished structural reductions in LTL mode , in 1 iterations and 41401 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-28 01:33:22] [INFO ] Flatten gal took : 30 ms
[2024-05-28 01:33:22] [INFO ] Flatten gal took : 31 ms
[2024-05-28 01:33:23] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-28 01:33:23] [INFO ] Flatten gal took : 32 ms
[2024-05-28 01:33:23] [INFO ] Flatten gal took : 34 ms
[2024-05-28 01:33:23] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 01:33:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 9 ms.
Total runtime 527301 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 612
TRANSITIONS: 1114
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1545
MODEL NAME: /home/mcc/execution/416/model
612 places, 1114 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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-S02J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S02J04T08, 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 r289-tajo-171654445500225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 ;