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.r048-tajo-171620399400369.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BugTracking-PT-q3m128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716332158128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 22:55:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:56:00] [INFO ] Load time of PNML (sax parser for PT used): 820 ms
[2024-05-21 22:56:00] [INFO ] Transformed 754 places.
[2024-05-21 22:56:00] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:56:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 514 places in 109 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Applied a total of 2 rules in 57 ms. Remains 238 /240 variables (removed 2) and now considering 2769/2769 (removed 0) transitions.
[2024-05-21 22:56:01] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 238 cols
[2024-05-21 22:56:01] [INFO ] Computed 8 invariants in 60 ms
[2024-05-21 22:56:01] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-21 22:56:01] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:56:01] [INFO ] Invariant cache hit.
[2024-05-21 22:56:02] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 22:56:03] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
Running 2767 sub problems to find dead transitions.
[2024-05-21 22:56:04] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:56:04] [INFO ] Invariant cache hit.
[2024-05-21 22:56:04] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2767 unsolved
[2024-05-21 22:56:44] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 15 ms to minimize.
[2024-05-21 22:56:44] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2024-05-21 22:56:44] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-21 22:56:45] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2024-05-21 22:56:53] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/2880 variables, and 13 constraints, problems are : Problem set: 14 solved, 2753 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2767/2767 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2753 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2753 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2767 is UNSAT
Problem TDEAD2768 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 5/13 constraints. Problems are: Problem set: 82 solved, 2685 unsolved
[2024-05-21 22:57:14] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-21 22:57:14] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/2880 variables, and 15 constraints, problems are : Problem set: 82 solved, 2685 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/238 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/2767 constraints, Known Traps: 7/7 constraints]
After SMT, in 88803ms problems are : Problem set: 82 solved, 2685 unsolved
Search for dead transitions found 82 dead transitions in 88885ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 2687/2769 transitions.
Reduce places removed 14 places and 394 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 224 transition count 2293
Reduce places removed 8 places and 189 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 216 transition count 2104
Reduce places removed 6 places and 135 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 210 transition count 1969
Reduce places removed 4 places and 77 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 32 place count 206 transition count 1892
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 204 transition count 1852
Deduced a syphon composed of 1 places in 6 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 204 transition count 1852
Deduced a syphon composed of 1 places in 5 ms
Applied a total of 36 rules in 61 ms. Remains 204 /238 variables (removed 34) and now considering 1852/2687 (removed 835) transitions.
[2024-05-21 22:57:32] [INFO ] Flow matrix only has 1765 transitions (discarded 87 similar events)
// Phase 1: matrix 1765 rows 204 cols
[2024-05-21 22:57:32] [INFO ] Computed 9 invariants in 13 ms
[2024-05-21 22:57:33] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-21 22:57:33] [INFO ] Flow matrix only has 1765 transitions (discarded 87 similar events)
[2024-05-21 22:57:33] [INFO ] Invariant cache hit.
[2024-05-21 22:57:33] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-21 22:57:34] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 204/240 places, 1852/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93780 ms. Remains : 204/240 places, 1852/2769 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 9 out of 203 places after structural reductions.
[2024-05-21 22:57:35] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 22:57:35] [INFO ] Flatten gal took : 231 ms
[2024-05-21 22:57:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m128-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:57:35] [INFO ] Flatten gal took : 129 ms
[2024-05-21 22:57:35] [INFO ] Input system was already deterministic with 1852 transitions.
Support contains 7 out of 203 places (down from 9) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1441 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 176490 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 6
Probabilistic random walk after 176490 steps, saw 84923 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-21 22:57:39] [INFO ] Flow matrix only has 1765 transitions (discarded 87 similar events)
// Phase 1: matrix 1765 rows 203 cols
[2024-05-21 22:57:39] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 22:57:39] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/68 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1502/1570 variables, 68/72 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1570 variables, 75/147 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1570 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 244/1814 variables, 104/251 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1814 variables, 2/253 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1814 variables, 94/347 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1814 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (OVERLAPS) 140/1954 variables, 18/365 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1954 variables, 23/388 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1954 variables, 0/388 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1956 variables, 1/389 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1956 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 12/1968 variables, 13/402 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1968 variables, 1/403 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1968 variables, 0/403 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1968 variables, 0/403 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 403 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 203/203 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 679/727 variables, 48/53 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/727 variables, 44/97 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 2/100 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 22:57:41] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 1/101 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/727 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 655/1382 variables, 53/154 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1382 variables, 68/222 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1382 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1382 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 544/1926 variables, 64/287 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1926 variables, 1/288 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1926 variables, 80/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1926 variables, 1/369 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1926 variables, 0/369 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/1931 variables, 2/371 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1931 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 37/1968 variables, 38/409 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1968 variables, 2/411 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 22:57:42] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2024-05-21 22:57:43] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1968 variables, 4/415 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1968 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1968 variables, 0/415 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1968/1968 variables, and 415 constraints, problems are : Problem set: 3 solved, 3 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 203/203 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 4410ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4615 ms.
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 1852/1852 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 1854
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 202 transition count 1847
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 195 transition count 1847
Applied a total of 16 rules in 125 ms. Remains 195 /203 variables (removed 8) and now considering 1847/1852 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 195/203 places, 1847/1852 transitions.
RANDOM walk for 40175 steps (8 resets) in 179 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 203642 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 203642 steps, saw 101434 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-21 22:57:52] [INFO ] Flow matrix only has 1757 transitions (discarded 90 similar events)
// Phase 1: matrix 1757 rows 195 cols
[2024-05-21 22:57:52] [INFO ] Computed 8 invariants in 16 ms
[2024-05-21 22:57:52] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 678/725 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/725 variables, 44/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 652/1377 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1377 variables, 68/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1377 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 542/1919 variables, 63/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1919 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1919 variables, 80/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1919 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/1920 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1920 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1920 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 32/1952 variables, 32/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1952 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1952 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1952 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 395 constraints, problems are : Problem set: 0 solved, 3 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 195/195 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 678/725 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 652/1377 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1377 variables, 68/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1377 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1377 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1377 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 542/1919 variables, 63/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1919 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1919 variables, 80/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1919 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1919 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/1920 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1920 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1920 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 32/1952 variables, 32/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1952 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 3 ms to minimize.
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1952 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1952 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/1952 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 405 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 195/195 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 2953ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1360 ms.
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 1847/1847 transitions.
Applied a total of 0 rules in 27 ms. Remains 195 /195 variables (removed 0) and now considering 1847/1847 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 195/195 places, 1847/1847 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 1847/1847 transitions.
Applied a total of 0 rules in 22 ms. Remains 195 /195 variables (removed 0) and now considering 1847/1847 (removed 0) transitions.
[2024-05-21 22:57:56] [INFO ] Flow matrix only has 1757 transitions (discarded 90 similar events)
[2024-05-21 22:57:56] [INFO ] Invariant cache hit.
[2024-05-21 22:57:56] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-21 22:57:56] [INFO ] Flow matrix only has 1757 transitions (discarded 90 similar events)
[2024-05-21 22:57:56] [INFO ] Invariant cache hit.
[2024-05-21 22:57:57] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-21 22:57:57] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2024-05-21 22:57:57] [INFO ] Redundant transitions in 117 ms returned []
Running 1846 sub problems to find dead transitions.
[2024-05-21 22:57:57] [INFO ] Flow matrix only has 1757 transitions (discarded 90 similar events)
[2024-05-21 22:57:57] [INFO ] Invariant cache hit.
[2024-05-21 22:57:57] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1846 unsolved
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
[2024-05-21 22:58:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-21 22:58:25] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
Problem TDEAD1811 is UNSAT
[2024-05-21 22:58:25] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/13 constraints. Problems are: Problem set: 217 solved, 1629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/13 constraints. Problems are: Problem set: 217 solved, 1629 unsolved
At refinement iteration 3 (OVERLAPS) 1757/1952 variables, 195/208 constraints. Problems are: Problem set: 217 solved, 1629 unsolved
SMT process timed out in 42683ms, After SMT, problems are : Problem set: 217 solved, 1629 unsolved
Search for dead transitions found 217 dead transitions in 42704ms
Found 217 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 217 transitions
Dead transitions reduction (with SMT) removed 217 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 195/195 places, 1630/1847 transitions.
Reduce places removed 12 places and 228 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 183 transition count 1402
Reduce places removed 10 places and 36 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 173 transition count 1366
Reduce places removed 7 places and 155 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 29 place count 166 transition count 1211
Reduce places removed 7 places and 99 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 159 transition count 1112
Reduce places removed 3 places and 69 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 39 place count 156 transition count 1043
Reduce places removed 3 places and 49 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 42 place count 153 transition count 994
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 53 place count 142 transition count 956
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 16 places and 223 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 80 place count 126 transition count 733
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 88 place count 118 transition count 685
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 96 place count 118 transition count 685
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 96 rules in 53 ms. Remains 118 /195 variables (removed 77) and now considering 685/1630 (removed 945) transitions.
[2024-05-21 22:58:40] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
// Phase 1: matrix 626 rows 118 cols
[2024-05-21 22:58:40] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 22:58:40] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 22:58:40] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
[2024-05-21 22:58:40] [INFO ] Invariant cache hit.
[2024-05-21 22:58:41] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:58:41] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/195 places, 685/1847 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44736 ms. Remains : 118/195 places, 685/1847 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40246 steps (8 resets) in 77 ms. (515 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 686762 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 1
Probabilistic random walk after 686762 steps, saw 416160 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-21 22:58:44] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
// Phase 1: matrix 626 rows 116 cols
[2024-05-21 22:58:44] [INFO ] Computed 8 invariants in 10 ms
[2024-05-21 22:58:44] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 457/476 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 43/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 193/669 variables, 56/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 24/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/731 variables, 28/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/731 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/734 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/734 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/734 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/742 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/742 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/742 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/742 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 457/476 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 43/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 193/669 variables, 56/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 24/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/731 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/731 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:58:44] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/731 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/731 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/734 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/734 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/742 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/742 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/742 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/742 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 742/742 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 685/685 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 685/685 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 116/116 places, 685/685 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 685/685 transitions.
Applied a total of 0 rules in 15 ms. Remains 116 /116 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-21 22:58:45] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
[2024-05-21 22:58:45] [INFO ] Invariant cache hit.
[2024-05-21 22:58:45] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 22:58:45] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
[2024-05-21 22:58:45] [INFO ] Invariant cache hit.
[2024-05-21 22:58:45] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 22:58:45] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-05-21 22:58:45] [INFO ] Redundant transitions in 7 ms returned []
Running 684 sub problems to find dead transitions.
[2024-05-21 22:58:45] [INFO ] Flow matrix only has 626 transitions (discarded 59 similar events)
[2024-05-21 22:58:45] [INFO ] Invariant cache hit.
[2024-05-21 22:58:45] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 684 unsolved
[2024-05-21 22:58:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:58:50] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
[2024-05-21 22:58:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD684 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/11 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 3 (OVERLAPS) 626/742 variables, 116/127 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 89/216 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 0/216 constraints. Problems are: Problem set: 8 solved, 676 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/742 variables, 0/216 constraints. Problems are: Problem set: 8 solved, 676 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 216 constraints, problems are : Problem set: 8 solved, 676 unsolved in 25083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 684/684 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 676 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/11 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 3 (OVERLAPS) 626/742 variables, 116/127 constraints. Problems are: Problem set: 8 solved, 676 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 89/216 constraints. Problems are: Problem set: 8 solved, 676 unsolved
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 676/892 constraints. Problems are: Problem set: 75 solved, 609 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/892 constraints. Problems are: Problem set: 75 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/742 variables, and 892 constraints, problems are : Problem set: 75 solved, 609 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 676/684 constraints, Known Traps: 3/3 constraints]
After SMT, in 57541ms problems are : Problem set: 75 solved, 609 unsolved
Search for dead transitions found 75 dead transitions in 57552ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 116/116 places, 610/685 transitions.
Reduce places removed 9 places and 156 transitions.
Graph (complete) has 701 edges and 107 vertex of which 1 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.3 ms
Discarding 106 places :
Also discarding 454 output transitions
Drop transitions (Output transitions of discarded places.) removed 454 transitions
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 17 ms. Remains 1 /116 variables (removed 115) and now considering 0/610 (removed 610) transitions.
[2024-05-21 22:59:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 22:59:43] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 22:59:43] [INFO ] Invariant cache hit.
[2024-05-21 22:59:43] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/116 places, 0/685 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58208 ms. Remains : 1/116 places, 0/685 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 6 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:59:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 22:59:43] [INFO ] Flatten gal took : 124 ms
FORMULA BugTracking-PT-q3m128-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:59:43] [INFO ] Flatten gal took : 109 ms
[2024-05-21 22:59:43] [INFO ] Input system was already deterministic with 1852 transitions.
Computed a total of 4 stabilizing places and 61 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1852/1852 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 202 transition count 1846
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 202 transition count 1846
Applied a total of 2 rules in 13 ms. Remains 202 /203 variables (removed 1) and now considering 1846/1852 (removed 6) transitions.
[2024-05-21 22:59:43] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
// Phase 1: matrix 1760 rows 202 cols
[2024-05-21 22:59:43] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 22:59:44] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-21 22:59:44] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
[2024-05-21 22:59:44] [INFO ] Invariant cache hit.
[2024-05-21 22:59:44] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-05-21 22:59:45] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Running 1844 sub problems to find dead transitions.
[2024-05-21 22:59:45] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
[2024-05-21 22:59:45] [INFO ] Invariant cache hit.
[2024-05-21 22:59:45] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
Problem TDEAD1473 is UNSAT
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 5 ms to minimize.
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
[2024-05-21 23:00:10] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
[2024-05-21 23:00:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
Problem TDEAD1796 is UNSAT
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1797 is UNSAT
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
Problem TDEAD1806 is UNSAT
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 13/21 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/21 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
At refinement iteration 3 (OVERLAPS) 1760/1961 variables, 201/222 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
SMT process timed out in 41403ms, After SMT, problems are : Problem set: 381 solved, 1463 unsolved
Search for dead transitions found 381 dead transitions in 41430ms
Found 381 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 381 transitions
Dead transitions reduction (with SMT) removed 381 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/203 places, 1465/1852 transitions.
Reduce places removed 29 places and 294 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 173 transition count 1171
Reduce places removed 7 places and 97 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 36 place count 166 transition count 1074
Reduce places removed 6 places and 28 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 160 transition count 1046
Reduce places removed 2 places and 41 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 158 transition count 1005
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 157 transition count 988
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 55 place count 147 transition count 954
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 223 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 81 place count 131 transition count 731
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 89 place count 123 transition count 683
Iterating global reduction 5 with 8 rules applied. Total rules applied 97 place count 123 transition count 683
Applied a total of 97 rules in 33 ms. Remains 123 /202 variables (removed 79) and now considering 683/1465 (removed 782) transitions.
[2024-05-21 23:00:26] [INFO ] Flow matrix only has 627 transitions (discarded 56 similar events)
// Phase 1: matrix 627 rows 123 cols
[2024-05-21 23:00:26] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:00:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 23:00:26] [INFO ] Flow matrix only has 627 transitions (discarded 56 similar events)
[2024-05-21 23:00:26] [INFO ] Invariant cache hit.
[2024-05-21 23:00:26] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 23:00:27] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/203 places, 683/1852 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43405 ms. Remains : 123/203 places, 683/1852 transitions.
[2024-05-21 23:00:27] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:00:27] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:00:27] [INFO ] Input system was already deterministic with 683 transitions.
[2024-05-21 23:00:27] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:00:27] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:00:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9525081912308802969.gal : 33 ms
[2024-05-21 23:00:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7147427969100457679.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9525081912308802969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7147427969100457679.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:00:57] [INFO ] Flatten gal took : 48 ms
[2024-05-21 23:00:57] [INFO ] Applying decomposition
[2024-05-21 23:00:57] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1315034256166719675.txt' '-o' '/tmp/graph1315034256166719675.bin' '-w' '/tmp/graph1315034256166719675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1315034256166719675.bin' '-l' '-1' '-v' '-w' '/tmp/graph1315034256166719675.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:00:57] [INFO ] Decomposing Gal with order
[2024-05-21 23:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:00:57] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-21 23:00:57] [INFO ] Flatten gal took : 103 ms
[2024-05-21 23:00:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 9 ms.
[2024-05-21 23:00:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14342233071266116032.gal : 9 ms
[2024-05-21 23:00:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7917351699597606070.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14342233071266116032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7917351699597606070.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 1852/1852 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 202 transition count 1846
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 202 transition count 1846
Applied a total of 2 rules in 18 ms. Remains 202 /203 variables (removed 1) and now considering 1846/1852 (removed 6) transitions.
[2024-05-21 23:01:30] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
// Phase 1: matrix 1760 rows 202 cols
[2024-05-21 23:01:30] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 23:01:31] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 23:01:31] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
[2024-05-21 23:01:31] [INFO ] Invariant cache hit.
[2024-05-21 23:01:31] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-05-21 23:01:32] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
Running 1844 sub problems to find dead transitions.
[2024-05-21 23:01:32] [INFO ] Flow matrix only has 1760 transitions (discarded 86 similar events)
[2024-05-21 23:01:32] [INFO ] Invariant cache hit.
[2024-05-21 23:01:32] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
[2024-05-21 23:01:58] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 4 ms to minimize.
Problem TDEAD1473 is UNSAT
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
Problem TDEAD1796 is UNSAT
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
Problem TDEAD1797 is UNSAT
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 3 ms to minimize.
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 3 ms to minimize.
Problem TDEAD1806 is UNSAT
[2024-05-21 23:02:01] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
[2024-05-21 23:02:01] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 13/21 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/21 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
At refinement iteration 3 (OVERLAPS) 1760/1961 variables, 201/222 constraints. Problems are: Problem set: 381 solved, 1463 unsolved
SMT process timed out in 41788ms, After SMT, problems are : Problem set: 381 solved, 1463 unsolved
Search for dead transitions found 381 dead transitions in 41817ms
Found 381 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 381 transitions
Dead transitions reduction (with SMT) removed 381 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/203 places, 1465/1852 transitions.
Reduce places removed 29 places and 294 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 173 transition count 1171
Reduce places removed 7 places and 97 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 36 place count 166 transition count 1074
Reduce places removed 6 places and 28 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 160 transition count 1046
Reduce places removed 2 places and 41 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 158 transition count 1005
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 157 transition count 988
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 55 place count 147 transition count 954
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 223 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 81 place count 131 transition count 731
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 89 place count 123 transition count 683
Iterating global reduction 5 with 8 rules applied. Total rules applied 97 place count 123 transition count 683
Applied a total of 97 rules in 13 ms. Remains 123 /202 variables (removed 79) and now considering 683/1465 (removed 782) transitions.
[2024-05-21 23:02:14] [INFO ] Flow matrix only has 627 transitions (discarded 56 similar events)
// Phase 1: matrix 627 rows 123 cols
[2024-05-21 23:02:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:02:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 23:02:14] [INFO ] Flow matrix only has 627 transitions (discarded 56 similar events)
[2024-05-21 23:02:14] [INFO ] Invariant cache hit.
[2024-05-21 23:02:14] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 23:02:14] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 123/203 places, 683/1852 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43895 ms. Remains : 123/203 places, 683/1852 transitions.
[2024-05-21 23:02:14] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:02:14] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:02:14] [INFO ] Input system was already deterministic with 683 transitions.
[2024-05-21 23:02:14] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:02:14] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:02:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality522019863289623574.gal : 4 ms
[2024-05-21 23:02:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14514254304659600684.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality522019863289623574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14514254304659600684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:02:45] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:02:45] [INFO ] Applying decomposition
[2024-05-21 23:02:45] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13259726849107714162.txt' '-o' '/tmp/graph13259726849107714162.bin' '-w' '/tmp/graph13259726849107714162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13259726849107714162.bin' '-l' '-1' '-v' '-w' '/tmp/graph13259726849107714162.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:02:45] [INFO ] Decomposing Gal with order
[2024-05-21 23:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:02:45] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-21 23:02:45] [INFO ] Flatten gal took : 52 ms
[2024-05-21 23:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 5 ms.
[2024-05-21 23:02:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17665479726721168749.gal : 7 ms
[2024-05-21 23:02:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16465099611824797261.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17665479726721168749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16465099611824797261.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:03:15] [INFO ] Flatten gal took : 103 ms
[2024-05-21 23:03:15] [INFO ] Flatten gal took : 88 ms
[2024-05-21 23:03:15] [INFO ] Applying decomposition
[2024-05-21 23:03:15] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15493011755950145671.txt' '-o' '/tmp/graph15493011755950145671.bin' '-w' '/tmp/graph15493011755950145671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15493011755950145671.bin' '-l' '-1' '-v' '-w' '/tmp/graph15493011755950145671.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:03:15] [INFO ] Decomposing Gal with order
[2024-05-21 23:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:03:16] [INFO ] Removed a total of 255 redundant transitions.
[2024-05-21 23:03:16] [INFO ] Flatten gal took : 156 ms
[2024-05-21 23:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 10 ms.
[2024-05-21 23:03:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality1003990269040313291.gal : 14 ms
[2024-05-21 23:03:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17441432607568973709.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1003990269040313291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17441432607568973709.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 23:17:45] [INFO ] Flatten gal took : 106 ms
[2024-05-21 23:17:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2001832974985925714.gal : 17 ms
[2024-05-21 23:17:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1629152300838735143.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2001832974985925714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1629152300838735143.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 23:34:08] [INFO ] Flatten gal took : 142 ms
[2024-05-21 23:34:08] [INFO ] Input system was already deterministic with 1852 transitions.
[2024-05-21 23:34:08] [INFO ] Transformed 203 places.
[2024-05-21 23:34:08] [INFO ] Transformed 1852 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:34:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6523394438549564656.gal : 19 ms
[2024-05-21 23:34:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality666678826069079904.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6523394438549564656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality666678826069079904.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3478923 ms.

BK_STOP 1716335638698

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m128, 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 r048-tajo-171620399400369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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