Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447100457.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447100457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 PolyORBNT-PT-S05J40-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S05J40-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717260325898

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:45:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:45:27] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-06-01 16:45:27] [INFO ] Transformed 629 places.
[2024-06-01 16:45:27] [INFO ] Transformed 1590 transitions.
[2024-06-01 16:45:27] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 278 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 85 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-06-01 16:45:28] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-06-01 16:45:28] [INFO ] Computed 102 invariants in 161 ms
[2024-06-01 16:45:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1560 variables, and 102 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 95 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
[2024-06-01 16:46:05] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 37 ms to minimize.
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/1560 variables, and 104 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 2/2 constraints]
After SMT, in 42732ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 42838ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-06-01 16:46:11] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2024-06-01 16:46:11] [INFO ] Computed 102 invariants in 25 ms
[2024-06-01 16:46:11] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-06-01 16:46:11] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:11] [INFO ] Invariant cache hit.
[2024-06-01 16:46:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:46:13] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 24 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45576 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 278 out of 629 places after structural reductions.
[2024-06-01 16:46:14] [INFO ] Flatten gal took : 136 ms
[2024-06-01 16:46:14] [INFO ] Flatten gal took : 86 ms
[2024-06-01 16:46:14] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 277 out of 629 places (down from 278) after GAL structural reductions.
RANDOM walk for 40000 steps (2765 resets) in 2187 ms. (18 steps per ms) remains 73/103 properties
BEST_FIRST walk for 4004 steps (120 resets) in 67 ms. (58 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (63 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (80 resets) in 54 ms. (72 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (69 resets) in 64 ms. (61 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (68 resets) in 46 ms. (85 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (97 resets) in 53 ms. (74 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (44 resets) in 58 ms. (67 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (60 resets) in 51 ms. (77 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (51 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (63 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (65 resets) in 36 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (96 resets) in 44 ms. (88 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (57 resets) in 25 ms. (153 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (66 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (73 resets) in 27 ms. (143 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (40 resets) in 40 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (58 resets) in 62 ms. (63 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (71 resets) in 40 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (120 resets) in 43 ms. (91 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (72 resets) in 37 ms. (105 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (86 resets) in 50 ms. (78 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (48 resets) in 51 ms. (76 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (53 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (98 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (76 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (53 resets) in 42 ms. (93 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (40 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (75 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (49 resets) in 23 ms. (166 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (98 resets) in 39 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (100 resets) in 72 ms. (54 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (75 resets) in 36 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (53 resets) in 25 ms. (154 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (70 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (50 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (58 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (51 resets) in 27 ms. (142 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (100 resets) in 33 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (83 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (65 resets) in 35 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (56 resets) in 28 ms. (138 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (48 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (54 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (79 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (54 resets) in 24 ms. (160 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4003 steps (81 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (72 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (68 resets) in 26 ms. (148 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (58 resets) in 22 ms. (174 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (63 resets) in 25 ms. (153 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (86 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (76 resets) in 24 ms. (160 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (71 resets) in 30 ms. (129 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (64 resets) in 23 ms. (166 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (70 resets) in 29 ms. (133 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (67 resets) in 30 ms. (129 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (61 resets) in 35 ms. (111 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (76 resets) in 27 ms. (142 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (75 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (67 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (77 resets) in 42 ms. (93 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (49 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (58 resets) in 23 ms. (166 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (41 resets) in 20 ms. (190 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (65 resets) in 24 ms. (160 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4003 steps (57 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (60 resets) in 31 ms. (125 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (61 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (72 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
[2024-06-01 16:46:16] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-06-01 16:46:16] [INFO ] Invariant cache hit.
[2024-06-01 16:46:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp101 is UNSAT
At refinement iteration 1 (OVERLAPS) 344/572 variables, 76/76 constraints. Problems are: Problem set: 49 solved, 22 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/78 constraints. Problems are: Problem set: 52 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 0/78 constraints. Problems are: Problem set: 52 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 4 (OVERLAPS) 56/628 variables, 24/102 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 0/102 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 836/1464 variables, 628/730 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1464 variables, 1/731 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1464 variables, 0/731 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1465 variables, 1/732 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1465 variables, 0/732 constraints. Problems are: Problem set: 69 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1465/1465 variables, and 732 constraints, problems are : Problem set: 69 solved, 2 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/160 variables, 2/7 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/328 variables, 28/35 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/35 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 140/468 variables, 28/63 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/63 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 147/615 variables, 26/89 constraints. Problems are: Problem set: 69 solved, 2 unsolved
[2024-06-01 16:46:19] [INFO ] Deduced a trap composed of 108 places in 402 ms of which 13 ms to minimize.
[2024-06-01 16:46:19] [INFO ] Deduced a trap composed of 128 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:46:19] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 3/92 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/92 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/628 variables, 13/105 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/105 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 836/1464 variables, 628/733 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1464 variables, 1/734 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1464 variables, 2/736 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1464 variables, 0/736 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1465 variables, 1/737 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1465 variables, 0/737 constraints. Problems are: Problem set: 69 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1465 variables, 0/737 constraints. Problems are: Problem set: 69 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1465/1465 variables, and 737 constraints, problems are : Problem set: 69 solved, 2 unsolved in 3481 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/71 constraints, Known Traps: 3/3 constraints]
After SMT, in 5531ms problems are : Problem set: 69 solved, 2 unsolved
Parikh walk visited 1 properties in 521 ms.
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 95 place count 579 transition count 751
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 183 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 532 transition count 748
Applied a total of 189 rules in 307 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:46:22] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-06-01 16:46:22] [INFO ] Computed 97 invariants in 13 ms
[2024-06-01 16:46:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:46:29] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:46:30] [INFO ] Deduced a trap composed of 146 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:46:31] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 138 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:46:32] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:46:33] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 148 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 180 places in 179 ms of which 13 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:46:36] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 2 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:46:37] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:46:38] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 163 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:46:48] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 6 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 5 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 142 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:46:49] [INFO ] Deduced a trap composed of 142 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 15 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 6 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:46:50] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:46:51] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:46:51] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:46:51] [INFO ] Deduced a trap composed of 142 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:46:51] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:46:52] [INFO ] Deduced a trap composed of 142 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:47:04] [INFO ] Deduced a trap composed of 208 places in 229 ms of which 3 ms to minimize.
SMT process timed out in 41327ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41660 ms. Remains : 532/629 places, 748/840 transitions.
RANDOM walk for 11672 steps (594 resets) in 330 ms. (35 steps per ms) remains 0/1 properties
Successfully simplified 69 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:47:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 16:47:04] [INFO ] Flatten gal took : 73 ms
[2024-06-01 16:47:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:47:04] [INFO ] Flatten gal took : 51 ms
[2024-06-01 16:47:04] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 68 out of 629 places (down from 79) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 44 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:47:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:47:04] [INFO ] Computed 97 invariants in 15 ms
[2024-06-01 16:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:47:31] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:47:32] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:47:34] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:47:34] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:47:34] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:47:34] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:47:39] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 3)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 4)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 9)
(s122 1)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41097ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41103ms
Finished structural reductions in LTL mode , in 1 iterations and 41149 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:47:45] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:47:45] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:47:45] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 68 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:47:45] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-06-01 16:47:45] [INFO ] Computed 97 invariants in 8 ms
[2024-06-01 16:47:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 176 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:47:52] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 175 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 191 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:47:55] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:47:56] [INFO ] Deduced a trap composed of 157 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:47:57] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:47:57] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:47:58] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 330 ms of which 3 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:47:59] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 2 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 2 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:48:00] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:48:01] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 95 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 175 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:48:13] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 94 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 2 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 94 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 241 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 182 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 243 places in 252 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 210 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 214 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:48:24] [INFO ] Deduced a trap composed of 155 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 220 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 204 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 205 places in 221 ms of which 5 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 210 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:48:25] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 157 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:48:26] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 4 ms to minimize.
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 41312ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41321ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41391 ms. Remains : 532/629 places, 748/840 transitions.
[2024-06-01 16:48:27] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:48:27] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:48:27] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 145 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-06-01 16:48:27] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-06-01 16:48:27] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:48:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 174 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 174 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 180 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 149 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:48:35] [INFO ] Deduced a trap composed of 146 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 138 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 145 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:48:36] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 148 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 171 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 143 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 144 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 143 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 147 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 2 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:48:40] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:48:41] [INFO ] Deduced a trap composed of 165 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:48:41] [INFO ] Deduced a trap composed of 174 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:48:41] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:48:42] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 4 ms to minimize.
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:48:43] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 184 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 183 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 169 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 153 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 180 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 182 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 161 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:48:58] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 179 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:48:59] [INFO ] Deduced a trap composed of 172 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 184 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 188 places in 209 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 152 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 60/60 constraints]
After SMT, in 41085ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41092ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41250 ms. Remains : 532/629 places, 748/840 transitions.
[2024-06-01 16:49:08] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:49:08] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:49:08] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 53 ms. Remains 531 /629 variables (removed 98) and now considering 747/840 (removed 93) transitions.
Running 741 sub problems to find dead transitions.
[2024-06-01 16:49:08] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-06-01 16:49:08] [INFO ] Computed 97 invariants in 10 ms
[2024-06-01 16:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 174 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:49:16] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 189 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 4 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:49:17] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 4 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1274 variables, and 132 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 219 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 159 places in 185 ms of which 2 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 221 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 101 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-06-01 16:49:40] [INFO ] Deduced a trap composed of 173 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:49:40] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:49:41] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:49:41] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:49:41] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:49:41] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:49:42] [INFO ] Deduced a trap composed of 176 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:49:42] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 176 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 168 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:49:43] [INFO ] Deduced a trap composed of 172 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:49:44] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:49:44] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:49:44] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:49:44] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:49:45] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:49:45] [INFO ] Deduced a trap composed of 141 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:49:45] [INFO ] Deduced a trap composed of 141 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:49:46] [INFO ] Deduced a trap composed of 180 places in 207 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1274 variables, and 172 constraints, problems are : Problem set: 0 solved, 741 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/741 constraints, Known Traps: 80/80 constraints]
After SMT, in 41154ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 41160ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41216 ms. Remains : 531/629 places, 747/840 transitions.
[2024-06-01 16:49:50] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:49:50] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:49:50] [INFO ] Input system was already deterministic with 747 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 51 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:49:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-06-01 16:49:50] [INFO ] Computed 97 invariants in 12 ms
[2024-06-01 16:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 131 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 110 places in 294 ms of which 3 ms to minimize.
SMT process timed out in 21357ms, After SMT, problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 21365ms
Finished structural reductions in LTL mode , in 1 iterations and 21419 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:50:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:50:11] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:50:11] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 32 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:50:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:50:11] [INFO ] Invariant cache hit.
[2024-06-01 16:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 99 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:50:34] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2024-06-01 16:50:34] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2024-06-01 16:50:38] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:50:39] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:50:39] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:50:41] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-06-01 16:50:41] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 1 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 2 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/18 constraints]
After SMT, in 41005ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41012ms
Finished structural reductions in LTL mode , in 1 iterations and 41046 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:50:52] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:50:52] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:50:52] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 20 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-06-01 16:50:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-06-01 16:50:52] [INFO ] Invariant cache hit.
[2024-06-01 16:50:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:51:24] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:51:24] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:51:24] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-06-01 16:51:25] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 40926ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 40933ms
Finished structural reductions in LTL mode , in 1 iterations and 40955 ms. Remains : 623/629 places, 839/840 transitions.
[2024-06-01 16:51:33] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:51:33] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:51:33] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 624 transition count 797
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 581 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 88 place count 580 transition count 752
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 57 ms. Remains 533 /629 variables (removed 96) and now considering 749/840 (removed 91) transitions.
Running 743 sub problems to find dead transitions.
[2024-06-01 16:51:34] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-06-01 16:51:34] [INFO ] Computed 97 invariants in 11 ms
[2024-06-01 16:51:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 139 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 180 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 175 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 2 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 163 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 2 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 148 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 145 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:51:43] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 2 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 4 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:51:47] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 2 ms to minimize.
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:51:48] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1278 variables, and 132 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 4 ms to minimize.
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:52:00] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:52:00] [INFO ] Deduced a trap composed of 96 places in 210 ms of which 2 ms to minimize.
[2024-06-01 16:52:01] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:52:01] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:52:01] [INFO ] Deduced a trap composed of 142 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:52:02] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:52:02] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:52:02] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:52:02] [INFO ] Deduced a trap composed of 147 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 146 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1278 variables, and 152 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/743 constraints, Known Traps: 60/60 constraints]
After SMT, in 41002ms problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 41008ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41067 ms. Remains : 533/629 places, 749/840 transitions.
[2024-06-01 16:52:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:52:15] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:52:15] [INFO ] Input system was already deterministic with 749 transitions.
[2024-06-01 16:52:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:52:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:52:15] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:52:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 840 transitions and 4204 arcs took 11 ms.
Total runtime 407969 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBNT-PT-S05J40-CTLCardinality-2024-15

BK_STOP 1717260735610

--------------------
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
mcc2024
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1793/ctl_0_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1793/ctl_1_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1793/ctl_2_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1793/ctl_3_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1793/ctl_4_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1793/ctl_5_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1793/ctl_6_
ctl formula name PolyORBNT-PT-S05J40-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1793/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J40, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447100457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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