Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920000113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K Jun 2 16:33 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 MedleyA-PT-15-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717369060959

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 22:57:43] [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-06-02 22:57:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:44] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-02 22:57:44] [INFO ] Transformed 192 places.
[2024-06-02 22:57:44] [INFO ] Transformed 475 transitions.
[2024-06-02 22:57:44] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:44] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 80 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 170 transition count 438
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 170 transition count 438
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 53 place count 170 transition count 429
Applied a total of 53 rules in 78 ms. Remains 170 /192 variables (removed 22) and now considering 429/473 (removed 44) transitions.
// Phase 1: matrix 429 rows 170 cols
[2024-06-02 22:57:44] [INFO ] Computed 7 invariants in 37 ms
[2024-06-02 22:57:44] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-02 22:57:44] [INFO ] Invariant cache hit.
[2024-06-02 22:57:45] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 22:57:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 23 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 97 places in 199 ms of which 4 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 3 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 8 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 11 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:57:54] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 2 ms to minimize.
[2024-06-02 22:57:54] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 4 ms to minimize.
[2024-06-02 22:57:54] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:57:55] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:57:55] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 22:57:56] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:57:57] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
[2024-06-02 22:57:57] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 3 ms to minimize.
[2024-06-02 22:57:57] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:57:59] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 22:58:02] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 103 places in 222 ms of which 4 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 3 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 22:58:07] [INFO ] Deduced a trap composed of 95 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:58:08] [INFO ] Deduced a trap composed of 115 places in 208 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 428 unsolved
SMT process timed out in 30656ms, After SMT, problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 30702ms
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 429/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31872 ms. Remains : 170/192 places, 429/473 transitions.
Support contains 80 out of 170 places after structural reductions.
[2024-06-02 22:58:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:58:16] [INFO ] Flatten gal took : 113 ms
[2024-06-02 22:58:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:58:16] [INFO ] Flatten gal took : 65 ms
[2024-06-02 22:58:16] [INFO ] Input system was already deterministic with 429 transitions.
Support contains 74 out of 170 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2262 ms. (17 steps per ms) remains 42/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
[2024-06-02 22:58:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 110/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 22:58:18] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 22:58:19] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-06-02 22:58:19] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 22:58:19] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 13/170 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 22:58:20] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-02 22:58:20] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 429/599 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/599 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 183 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/157 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:58:23] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:58:23] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 13/170 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 429/599 variables, 170/185 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 34/219 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:58:24] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:58:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-02 22:58:24] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-06-02 22:58:25] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 4/223 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:58:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/599 variables, and 224 constraints, problems are : Problem set: 1 solved, 34 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 13/13 constraints]
After SMT, in 9077ms problems are : Problem set: 1 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 429/429 transitions.
Graph (trivial) has 99 edges and 170 vertex of which 3 / 170 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 168 transition count 417
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 159 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 157 transition count 415
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 23 place count 157 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 151 transition count 409
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 45 place count 141 transition count 396
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 141 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 141 transition count 394
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 57 place count 141 transition count 390
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 65 place count 137 transition count 390
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 137 transition count 389
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 94 place count 123 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 123 transition count 374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 122 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 122 transition count 370
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 125 place count 108 transition count 456
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 132 place count 108 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 7 with 29 rules applied. Total rules applied 161 place count 108 transition count 420
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 168 place count 108 transition count 413
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 175 place count 101 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 180 place count 101 transition count 408
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 100 transition count 421
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 184 place count 100 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 186 place count 100 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 187 place count 99 transition count 416
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 20 edges and 97 vertex of which 5 / 97 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 190 place count 94 transition count 416
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 210 place count 94 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 11 with 73 rules applied. Total rules applied 283 place count 94 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 284 place count 94 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 285 place count 93 transition count 322
Applied a total of 285 rules in 260 ms. Remains 93 /170 variables (removed 77) and now considering 322/429 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 93/170 places, 322/429 transitions.
RANDOM walk for 38046 steps (7218 resets) in 840 ms. (45 steps per ms) remains 0/34 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-02 22:58:27] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:58:27] [INFO ] Flatten gal took : 44 ms
[2024-06-02 22:58:28] [INFO ] Input system was already deterministic with 429 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 390
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 390
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 62 place count 146 transition count 376
Applied a total of 62 rules in 16 ms. Remains 146 /170 variables (removed 24) and now considering 376/429 (removed 53) transitions.
// Phase 1: matrix 376 rows 146 cols
[2024-06-02 22:58:28] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:58:28] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 22:58:28] [INFO ] Invariant cache hit.
[2024-06-02 22:58:28] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-06-02 22:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-06-02 22:58:32] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 4 ms to minimize.
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-06-02 22:58:34] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:58:34] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-06-02 22:58:34] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 22:58:36] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-06-02 22:58:36] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:58:37] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 22:58:41] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 376/522 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 169 constraints, problems are : Problem set: 0 solved, 375 unsolved in 26800 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/522 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 375/544 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 22:59:07] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 22:59:17] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 546 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 18/18 constraints]
After SMT, in 57217ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 57226ms
Starting structural reductions in LTL mode, iteration 1 : 146/170 places, 376/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57651 ms. Remains : 146/170 places, 376/429 transitions.
[2024-06-02 22:59:25] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:59:25] [INFO ] Flatten gal took : 35 ms
[2024-06-02 22:59:25] [INFO ] Input system was already deterministic with 376 transitions.
[2024-06-02 22:59:25] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:59:25] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:59:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8259392799828974768.gal : 13 ms
[2024-06-02 22:59:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1404164776712455595.ctl : 72 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/CTLCardinality8259392799828974768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1404164776712455595.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9879e+06,0.976595,24104,2,4849,5,58034,6,0,962,82288,0


Converting to forward existential form...Done !
original formula: AX(AG(!(A(((p66==1) + EG(((p55==0)||(p43==1)))) U !(((p135==0)||(p108==1)))))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EG(!(!(((p135==0)||(p108==1))))))) * !(E(!(!(((p135==0)||(p108==1)))) U (!(((p66==1) ...227
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t48, t52, t56, t58,...552
(forward)formula 0,0,4.86469,98716,1,0,692,419657,781,364,8045,380419,827
FORMULA MedleyA-PT-15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 143 transition count 385
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 143 transition count 385
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 68 place count 143 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 142 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 142 transition count 369
Applied a total of 70 rules in 25 ms. Remains 142 /170 variables (removed 28) and now considering 369/429 (removed 60) transitions.
// Phase 1: matrix 369 rows 142 cols
[2024-06-02 22:59:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:59:31] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 22:59:31] [INFO ] Invariant cache hit.
[2024-06-02 22:59:31] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-02 22:59:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 3 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 83 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:59:38] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:59:38] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
[2024-06-02 22:59:38] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:59:39] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:59:39] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-02 22:59:39] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-02 22:59:39] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 6 ms to minimize.
[2024-06-02 22:59:40] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-02 22:59:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 22:59:42] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:59:42] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/511 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 22:59:51] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 172 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 368/540 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 540 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 23/23 constraints]
After SMT, in 60349ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Starting structural reductions in LTL mode, iteration 1 : 142/170 places, 369/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 142/170 places, 369/429 transitions.
[2024-06-02 23:00:31] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:00:31] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:00:31] [INFO ] Input system was already deterministic with 369 transitions.
[2024-06-02 23:00:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:00:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:00:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3409259017741625403.gal : 7 ms
[2024-06-02 23:00:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13000578899924790815.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/CTLCardinality3409259017741625403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13000578899924790815.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.718153,24712,2,4921,5,59781,6,0,939,82195,0


Converting to forward existential form...Done !
original formula: A(E(EX((p132!=1)) U !(((p176!=1)&&(p49==1)))) U EX(AG(AX(((p150==0)||(p51==0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!(EX(!(((p150==0)||(p51==0))))))))))))) * !(E(!(EX(!(E(TRUE U !(!(EX(!(((p150==...297
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t48, t52, t56, t58, t64,...514
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.1831,293780,1,0,706,1.87265e+06,771,371,8065,1.1325e+06,852
FORMULA MedleyA-PT-15-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Graph (trivial) has 180 edges and 170 vertex of which 9 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 163 transition count 403
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 23 rules applied. Total rules applied 43 place count 144 transition count 399
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 141 transition count 399
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 46 place count 141 transition count 394
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 136 transition count 394
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 82 place count 110 transition count 348
Iterating global reduction 3 with 26 rules applied. Total rules applied 108 place count 110 transition count 348
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 125 place count 110 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 109 transition count 331
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 126 place count 109 transition count 327
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 134 place count 105 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 104 transition count 325
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 104 transition count 325
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 160 place count 92 transition count 313
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 91 transition count 309
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 91 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 173 place count 91 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 177 place count 89 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 88 transition count 295
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 101 edges and 86 vertex of which 35 / 86 are part of one of the 14 SCC in 1 ms
Free SCC test removed 21 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 181 place count 65 transition count 295
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 6 with 70 rules applied. Total rules applied 251 place count 65 transition count 225
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 256 place count 60 transition count 170
Iterating global reduction 7 with 5 rules applied. Total rules applied 261 place count 60 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 263 place count 60 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 267 place count 58 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 8 with 53 rules applied. Total rules applied 320 place count 58 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 2 rules applied. Total rules applied 322 place count 58 transition count 111
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 326 place count 56 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 328 place count 54 transition count 109
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 329 place count 53 transition count 105
Iterating global reduction 11 with 1 rules applied. Total rules applied 330 place count 53 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 334 place count 51 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 335 place count 51 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 336 place count 51 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 337 place count 50 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 338 place count 50 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 339 place count 50 transition count 100
Applied a total of 339 rules in 91 ms. Remains 50 /170 variables (removed 120) and now considering 100/429 (removed 329) transitions.
// Phase 1: matrix 100 rows 50 cols
[2024-06-02 23:00:44] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:00:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 23:00:44] [INFO ] Invariant cache hit.
[2024-06-02 23:00:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:00:44] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 23:00:44] [INFO ] Redundant transitions in 26 ms returned [95, 96, 98]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 91 sub problems to find dead transitions.
// Phase 1: matrix 97 rows 50 cols
[2024-06-02 23:00:44] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:00:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 78 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3353 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 91/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 169 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2930 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 6331ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6332ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/170 places, 97/429 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 49 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 48 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 47 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 47 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 47 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9 place count 46 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 10 place count 46 transition count 91
Applied a total of 10 rules in 19 ms. Remains 46 /50 variables (removed 4) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 46 cols
[2024-06-02 23:00:50] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:00:51] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 23:00:51] [INFO ] Invariant cache hit.
[2024-06-02 23:00:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:00:51] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/170 places, 91/429 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6957 ms. Remains : 46/170 places, 91/429 transitions.
[2024-06-02 23:00:51] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:00:51] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:00:51] [INFO ] Input system was already deterministic with 91 transitions.
[2024-06-02 23:00:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:00:51] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:00:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1734543848328903302.gal : 3 ms
[2024-06-02 23:00:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10809134877827299651.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/CTLCardinality1734543848328903302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10809134877827299651.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6882,0.276828,8828,2,2086,5,15672,5,0,276,16744,0


Converting to forward existential form...Done !
original formula: E(EG(!(((p110==0)||(p166==1)))) U AG(EF(!((((p127==0)&&(p22==0))||(p93==1))))))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(((p110==0)||(p166==1))))) * !(E(TRUE U !(E(TRUE U !((((p127==0)&&(p22==0))||(p93==1))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t10, t12, t14, t16, t21, t24, t26, t28, t35, t36, t37, t63, t64, t65, t68, t71, t...267
(forward)formula 0,0,2.36513,52164,1,0,225,260927,213,111,2300,163933,241
FORMULA MedleyA-PT-15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 147 transition count 392
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 147 transition count 392
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 147 transition count 387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 146 transition count 385
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 146 transition count 385
Applied a total of 53 rules in 10 ms. Remains 146 /170 variables (removed 24) and now considering 385/429 (removed 44) transitions.
// Phase 1: matrix 385 rows 146 cols
[2024-06-02 23:00:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:00:53] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 23:00:53] [INFO ] Invariant cache hit.
[2024-06-02 23:00:54] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-06-02 23:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 23:00:58] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:00:59] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:00:59] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-02 23:00:59] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:00:59] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:01:00] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:01:00] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:01:00] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:01:01] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:01:01] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:01:01] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:01:01] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 2 ms to minimize.
[2024-06-02 23:01:01] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:01:02] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:01:03] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 23:01:04] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:01:05] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 23:01:13] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-06-02 23:01:17] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 5 ms to minimize.
[2024-06-02 23:01:17] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 385/531 variables, 146/177 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 177 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (OVERLAPS) 385/531 variables, 146/177 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 384/561 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 24/24 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 146/170 places, 385/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 146/170 places, 385/429 transitions.
[2024-06-02 23:01:54] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:01:54] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:01:54] [INFO ] Input system was already deterministic with 385 transitions.
[2024-06-02 23:01:54] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:01:54] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:01:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality8581113950815116234.gal : 10 ms
[2024-06-02 23:01:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality434213192887887785.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/CTLCardinality8581113950815116234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality434213192887887785.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.90913e+06,0.753418,23772,2,4691,5,57026,6,0,971,78660,0


Converting to forward existential form...Done !
original formula: E(((!(AF(!(AX(((p161==0)||(p141==1)))))) + (p93==0)) + (p138==1)) U !((A(EF(((p112==0)||(p147==1))) U ((EX((p65==1)) * EX(((p65==0)||(p47...212
=> equivalent forward existential formula: ((([(((FwdU(FwdU(Init,((!(!(EG(!(!(!(EX(!(((p161==0)||(p141==1)))))))))) + (p93==0)) + (p138==1))),!(((EX((p65==...949
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t23, t24, t27, t28, t35, t36, t38, t39, t41, t42, t45, t48, t49, t50,...551
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.828,354816,1,0,928,1.77288e+06,814,552,8386,1.74928e+06,1141
FORMULA MedleyA-PT-15-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 143 transition count 385
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 143 transition count 385
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 71 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 142 transition count 366
Applied a total of 73 rules in 6 ms. Remains 142 /170 variables (removed 28) and now considering 366/429 (removed 63) transitions.
// Phase 1: matrix 366 rows 142 cols
[2024-06-02 23:02:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:02:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 23:02:10] [INFO ] Invariant cache hit.
[2024-06-02 23:02:11] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 23:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:02:15] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:02:15] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:02:15] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:02:15] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:02:15] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:02:16] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:02:17] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:02:17] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 2 ms to minimize.
[2024-06-02 23:02:17] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:02:18] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:02:19] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:02:19] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:02:20] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:02:20] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:02:21] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:02:28] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:02:29] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:02:29] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:02:37] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 176 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/176 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/541 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 541 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 27/27 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in LTL mode, iteration 1 : 142/170 places, 366/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 142/170 places, 366/429 transitions.
[2024-06-02 23:03:11] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:03:11] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:03:11] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-02 23:03:11] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:03:11] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:03:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality707706053230615721.gal : 3 ms
[2024-06-02 23:03:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality6877472662106980475.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/CTLCardinality707706053230615721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6877472662106980475.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88658e+06,0.701081,21524,2,4568,5,51140,6,0,936,72307,0


Converting to forward existential form...Done !
original formula: EX((((AG((p165==0)) * EX(TRUE)) * ((p19==0) * !(A(((p34==0)||(p28==1)) U (p111==1))))) * EG((p86==0))))
=> equivalent forward existential formula: [FwdG((EY(Init) * ((!(E(TRUE U !((p165==0)))) * EX(TRUE)) * ((p19==0) * !(!((E(!((p111==1)) U (!(((p34==0)||(p28...223
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t59,...542
(forward)formula 0,0,27.276,572604,1,0,966,3.68681e+06,774,520,7872,2.89762e+06,1137
FORMULA MedleyA-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Graph (trivial) has 188 edges and 170 vertex of which 9 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 163 transition count 401
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 142 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 141 transition count 399
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 46 place count 141 transition count 393
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 135 transition count 393
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 84 place count 109 transition count 347
Iterating global reduction 3 with 26 rules applied. Total rules applied 110 place count 109 transition count 347
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 127 place count 109 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 108 transition count 330
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 128 place count 108 transition count 325
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 138 place count 103 transition count 325
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 102 transition count 323
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 102 transition count 323
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 160 place count 92 transition count 313
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 90 transition count 306
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 90 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 178 place count 90 transition count 292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 88 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 87 transition count 289
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 108 edges and 85 vertex of which 36 / 85 are part of one of the 14 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 186 place count 63 transition count 289
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 6 with 83 rules applied. Total rules applied 269 place count 63 transition count 206
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 275 place count 57 transition count 149
Iterating global reduction 7 with 6 rules applied. Total rules applied 281 place count 57 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 283 place count 57 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 287 place count 55 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 328 place count 55 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 6 rules applied. Total rules applied 334 place count 55 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 340 place count 49 transition count 98
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 342 place count 47 transition count 93
Iterating global reduction 10 with 2 rules applied. Total rules applied 344 place count 47 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 348 place count 45 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 352 place count 45 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 354 place count 45 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 356 place count 43 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 356 place count 43 transition count 83
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 360 place count 41 transition count 83
Applied a total of 360 rules in 167 ms. Remains 41 /170 variables (removed 129) and now considering 83/429 (removed 346) transitions.
// Phase 1: matrix 83 rows 41 cols
[2024-06-02 23:03:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:03:39] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 23:03:39] [INFO ] Invariant cache hit.
[2024-06-02 23:03:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 23:03:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 23:03:39] [INFO ] Redundant transitions in 22 ms returned [82]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 80 sub problems to find dead transitions.
// Phase 1: matrix 82 rows 41 cols
[2024-06-02 23:03:39] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 23:03:39] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 23:03:39] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:03:39] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/122 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 23:03:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/123 variables, and 81 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4462 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/122 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/123 variables, and 161 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints]
After SMT, in 6851ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6853ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/170 places, 82/429 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 80
Applied a total of 4 rules in 4 ms. Remains 39 /41 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 39 cols
[2024-06-02 23:03:46] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 23:03:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 23:03:46] [INFO ] Invariant cache hit.
[2024-06-02 23:03:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 23:03:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/170 places, 80/429 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7445 ms. Remains : 39/170 places, 80/429 transitions.
[2024-06-02 23:03:46] [INFO ] Flatten gal took : 3 ms
[2024-06-02 23:03:46] [INFO ] Flatten gal took : 2 ms
[2024-06-02 23:03:46] [INFO ] Input system was already deterministic with 80 transitions.
[2024-06-02 23:03:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:03:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:03:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13743001232696921247.gal : 2 ms
[2024-06-02 23:03:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15808182578690249971.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/CTLCardinality13743001232696921247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15808182578690249971.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1838,0.063564,5588,2,975,5,6173,5,0,236,5141,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((p30==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((p30==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t10, t14, t15, t17, t19, t21, t39, t51, t52, t56, t57, Intersection with rea...231
(forward)formula 0,0,0.240768,11132,1,0,167,28596,185,81,2023,20647,174
FORMULA MedleyA-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 142 transition count 383
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 142 transition count 383
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 73 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 141 transition count 364
Applied a total of 75 rules in 6 ms. Remains 141 /170 variables (removed 29) and now considering 364/429 (removed 65) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 23:03:46] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 23:03:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 23:03:46] [INFO ] Invariant cache hit.
[2024-06-02 23:03:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 23:03:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:03:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:03:51] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:03:51] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:03:51] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 2 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:03:52] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-06-02 23:03:53] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:03:53] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:03:53] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:03:53] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:03:54] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:03:54] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:03:54] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:03:54] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:03:55] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-06-02 23:03:55] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:03:55] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:03:56] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:01] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:04] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:11] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 23:04:16] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 141/170 places, 364/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 141/170 places, 364/429 transitions.
[2024-06-02 23:04:47] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:04:47] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:04:47] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-02 23:04:47] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:04:47] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18014945512710651826.gal : 4 ms
[2024-06-02 23:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1198010371978992772.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/CTLCardinality18014945512710651826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1198010371978992772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81482e+06,0.931041,20196,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: EX((EF(((AX((p153==1)) * (p45==0)) * (p0==1))) + AG((p39==0))))
=> equivalent forward existential formula: ([(((FwdU(EY(Init),TRUE) * (p0==1)) * (p45==0)) * !(EX(!((p153==1)))))] != FALSE + [(EY(Init) * !(E(TRUE U !((p3...175
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,0,8.49137,192648,1,0,668,1.17119e+06,752,353,7864,682275,792
FORMULA MedleyA-PT-15-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 144 transition count 386
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 144 transition count 386
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 66 place count 144 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 143 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 143 transition count 370
Applied a total of 68 rules in 4 ms. Remains 143 /170 variables (removed 27) and now considering 370/429 (removed 59) transitions.
// Phase 1: matrix 370 rows 143 cols
[2024-06-02 23:04:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:04:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:04:56] [INFO ] Invariant cache hit.
[2024-06-02 23:04:56] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-06-02 23:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-06-02 23:05:01] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:05:02] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:05:03] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 2 ms to minimize.
[2024-06-02 23:05:03] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:05:03] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:05:03] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:10] [INFO ] Deduced a trap composed of 98 places in 191 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:13] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:05:13] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:16] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 370/513 variables, 143/175 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 175 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 370/513 variables, 143/175 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 369/544 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 23:05:35] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 545 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 26/26 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 143/170 places, 370/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 143/170 places, 370/429 transitions.
[2024-06-02 23:05:56] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:05:56] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:05:56] [INFO ] Input system was already deterministic with 370 transitions.
[2024-06-02 23:05:56] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:05:56] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:05:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality568092956115674121.gal : 5 ms
[2024-06-02 23:05:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3193236226786577398.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/CTLCardinality568092956115674121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3193236226786577398.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88946e+06,0.773115,20764,2,4354,5,48682,6,0,944,69747,0


Converting to forward existential form...Done !
original formula: A(E(!(AX(((!((p77==0)||(p70==1)))||(((p118==0)||(p117==1))&&((p166==0)||(p140==1)))))) U (p35==1)) U !(AX(!(AG(((p96==1)||(p175==0)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EX(!(!(!(E(TRUE U !(((p96==1)||(p175==0)))))))))))))) * !(E(!(!(!(EX(!(!(!(E(TRUE U !(((p96...362
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t58, t63,...519
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,17.6721,416596,1,0,1005,2.6952e+06,776,571,8090,2.07345e+06,1090
FORMULA MedleyA-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 144 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 144 transition count 387
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 69 place count 144 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 143 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 143 transition count 368
Applied a total of 71 rules in 5 ms. Remains 143 /170 variables (removed 27) and now considering 368/429 (removed 61) transitions.
// Phase 1: matrix 368 rows 143 cols
[2024-06-02 23:06:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
[2024-06-02 23:06:14] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-06-02 23:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:18] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:06:18] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 2 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:06:19] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-02 23:06:20] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:06:21] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:06:22] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:06:22] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:06:22] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:25] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:29] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/511 variables, 143/170 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:38] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:42] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 172 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 23:06:47] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/511 variables, 143/173 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 367/540 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 0/511 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 540 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 143/170 places, 368/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60484 ms. Remains : 143/170 places, 368/429 transitions.
[2024-06-02 23:07:14] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:07:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:07:15] [INFO ] Input system was already deterministic with 368 transitions.
[2024-06-02 23:07:15] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:07:15] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:07:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2664531740467215228.gal : 4 ms
[2024-06-02 23:07:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9144385478648853350.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/CTLCardinality2664531740467215228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9144385478648853350.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.985178,22852,2,4686,5,53306,6,0,942,73785,0


Converting to forward existential form...Done !
original formula: !(E(EX(TRUE) U ((p98!=0)&&((p94==0)||(p26==1)))))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * ((p98!=0)&&((p94==0)||(p26==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...531
(forward)formula 0,0,3.5661,82704,1,0,644,340943,753,334,7893,297494,745
FORMULA MedleyA-PT-15-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 145 transition count 389
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 145 transition count 389
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 67 place count 145 transition count 372
Applied a total of 67 rules in 3 ms. Remains 145 /170 variables (removed 25) and now considering 372/429 (removed 57) transitions.
// Phase 1: matrix 372 rows 145 cols
[2024-06-02 23:07:18] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:07:18] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:07:18] [INFO ] Invariant cache hit.
[2024-06-02 23:07:19] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2024-06-02 23:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 3 ms to minimize.
[2024-06-02 23:07:23] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 96 places in 196 ms of which 2 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 96 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:07:26] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:07:27] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:07:28] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:07:29] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:07:30] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:07:30] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:07:30] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/517 variables, 145/174 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:07:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 175 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/517 variables, 145/175 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 371/546 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2024-06-02 23:08:00] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 547 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 24/24 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 145/170 places, 372/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 145/170 places, 372/429 transitions.
[2024-06-02 23:08:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:08:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:08:19] [INFO ] Input system was already deterministic with 372 transitions.
[2024-06-02 23:08:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:08:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:08:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality6250349248945866062.gal : 3 ms
[2024-06-02 23:08:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7996744167103800431.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/CTLCardinality6250349248945866062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7996744167103800431.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91487e+06,0.715546,21552,2,4471,5,49083,6,0,954,68232,0


Converting to forward existential form...Done !
original formula: E(((p165==0) * !(EF(!(AF((p84==0)))))) U AF(((p101==1) * !((A((p106==0) U ((p93==0)||(p24==1))) * AX((p72==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,((p165==0) * !(E(TRUE U !(!(EG(!((p84==0))))))))) * !(EG(!(((p101==1) * !((!((E(!(((p93==0)||(p24==1...272
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t64,...547
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.19327,191520,1,0,702,1.123e+06,792,370,8107,720786,844
FORMULA MedleyA-PT-15-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 143 transition count 385
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 143 transition count 385
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 71 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 142 transition count 366
Applied a total of 73 rules in 6 ms. Remains 142 /170 variables (removed 28) and now considering 366/429 (removed 63) transitions.
// Phase 1: matrix 366 rows 142 cols
[2024-06-02 23:08:27] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:08:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 23:08:27] [INFO ] Invariant cache hit.
[2024-06-02 23:08:27] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 23:08:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:08:32] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:08:33] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:08:34] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:08:34] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:08:34] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:08:34] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:08:35] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-06-02 23:08:36] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:08:37] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:08:38] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:08:42] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 23:08:45] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:08:45] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:08:46] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 170 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 535 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 142/170 places, 366/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 142/170 places, 366/429 transitions.
[2024-06-02 23:09:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:09:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:09:28] [INFO ] Input system was already deterministic with 366 transitions.
[2024-06-02 23:09:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:09:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:09:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality12322933277689736408.gal : 3 ms
[2024-06-02 23:09:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality18259180953003986334.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/CTLCardinality12322933277689736408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18259180953003986334.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.964449,23108,2,4740,5,55153,6,0,936,76743,0


Converting to forward existential form...Done !
original formula: AG((!(E(AG(((p158==0)&&((p37==0)||(p86==1)))) U (((!(((p68==0)||(p99==1))) + EX((p21==1))) * ((p47==1)||(p45==1))) * (p49==0)))) + EX(EX(...171
=> equivalent forward existential formula: ([(((FwdU((FwdU(Init,TRUE) * !(EX(EX(!(E(TRUE U !((p87!=1)))))))),!(E(TRUE U !(((p158==0)&&((p37==0)||(p86==1)))...411
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t25, t26, t33, t34, t36, t39, t40, t43, t46, t48, t52, t56, t58, t64,...514
(forward)formula 0,0,16.5205,348220,1,0,760,2.20199e+06,763,407,7830,1.4607e+06,893
FORMULA MedleyA-PT-15-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Graph (trivial) has 177 edges and 170 vertex of which 9 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 163 transition count 401
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 142 transition count 400
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 44 place count 142 transition count 394
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 136 transition count 394
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 79 place count 113 transition count 352
Iterating global reduction 2 with 23 rules applied. Total rules applied 102 place count 113 transition count 352
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 113 place count 113 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 112 transition count 341
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 114 place count 112 transition count 339
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 110 transition count 339
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 109 transition count 337
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 109 transition count 337
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 146 place count 96 transition count 324
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 94 transition count 317
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 94 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 164 place count 94 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 92 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 91 transition count 300
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 92 edges and 90 vertex of which 15 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 171 place count 81 transition count 300
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 205 place count 81 transition count 266
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 207 place count 79 transition count 234
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 79 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 221 place count 79 transition count 222
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 79 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 78 transition count 221
Applied a total of 223 rules in 53 ms. Remains 78 /170 variables (removed 92) and now considering 221/429 (removed 208) transitions.
[2024-06-02 23:09:44] [INFO ] Flow matrix only has 184 transitions (discarded 37 similar events)
// Phase 1: matrix 184 rows 78 cols
[2024-06-02 23:09:44] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 23:09:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:09:45] [INFO ] Flow matrix only has 184 transitions (discarded 37 similar events)
[2024-06-02 23:09:45] [INFO ] Invariant cache hit.
[2024-06-02 23:09:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 23:09:45] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 23:09:45] [INFO ] Redundant transitions in 22 ms returned []
Running 214 sub problems to find dead transitions.
[2024-06-02 23:09:45] [INFO ] Flow matrix only has 184 transitions (discarded 37 similar events)
[2024-06-02 23:09:45] [INFO ] Invariant cache hit.
[2024-06-02 23:09:45] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 23:09:45] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:09:45] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
[2024-06-02 23:09:46] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:09:46] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:09:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:09:46] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 183/261 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 112 constraints, problems are : Problem set: 0 solved, 214 unsolved in 6906 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 23:09:52] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:09:53] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 183/261 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 214/328 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 328 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9843 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 8/8 constraints]
After SMT, in 16826ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 16828ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/170 places, 221/429 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17126 ms. Remains : 78/170 places, 221/429 transitions.
[2024-06-02 23:10:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:10:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:10:02] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-02 23:10:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:10:02] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:10:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality1326222050748745977.gal : 48 ms
[2024-06-02 23:10:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13715054096367501983.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/CTLCardinality1326222050748745977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13715054096367501983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,106100,0.276323,9404,2,1653,5,21186,6,0,528,19797,0


Converting to forward existential form...Done !
original formula: EF(((AF(!(E((p149==0) U (p131!=0)))) * ((p128==0)||(p64==1))) * (AF(((p53==0)||(p126==1))) + AG(((p190==0)||(p122==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EG(!(!(E((p149==0) U (p131!=0)))))) * ((p128==0)||(p64==1)))) * !(EG(!(((p53==0)||(p126...315
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t9, t11, t14, t17, t27, t28, t31, t32, t36, t39, t42, t46, t49, t51, t54, t55, t57, t...328
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.12401,78128,1,0,495,435767,469,285,4227,375888,601
FORMULA MedleyA-PT-15-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 145 transition count 388
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 145 transition count 388
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 67 place count 145 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 144 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 144 transition count 369
Applied a total of 69 rules in 5 ms. Remains 144 /170 variables (removed 26) and now considering 369/429 (removed 60) transitions.
// Phase 1: matrix 369 rows 144 cols
[2024-06-02 23:10:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:10:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:10:05] [INFO ] Invariant cache hit.
[2024-06-02 23:10:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-02 23:10:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:10:12] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:10:12] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:10:15] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:16] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:10:16] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:21] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:24] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 369/513 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:32] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 172 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 23:10:39] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/513 variables, 144/173 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 368/541 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 541 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 22/22 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 144/170 places, 369/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 144/170 places, 369/429 transitions.
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:11:06] [INFO ] Input system was already deterministic with 369 transitions.
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:11:06] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:11:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14828250731119424673.gal : 5 ms
[2024-06-02 23:11:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15790841419345286105.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/CTLCardinality14828250731119424673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15790841419345286105.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04282e+06,1.02428,26552,2,5653,5,63014,6,0,947,93615,0


Converting to forward existential form...Done !
original formula: A((p32==1) U ((p94!=0) + ((!(EX(AG((p97==0)))) * (p120!=1)) * ((p127==0)||(p25==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p94!=0) + ((!(EX(!(E(TRUE U !((p97==0)))))) * (p120!=1)) * ((p127==0)||(p25==1)))))))) * !(E(...361
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t15, t20, t21, t24, t25, t32, t33, t35, t38, t39, t42, t45, t47, t51, t53, t55, t57,...535
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.3011,270124,1,0,746,1.67423e+06,773,392,8102,1.10721e+06,866
FORMULA MedleyA-PT-15-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 429/429 transitions.
Graph (trivial) has 184 edges and 170 vertex of which 9 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 163 transition count 401
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 142 transition count 401
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 43 place count 142 transition count 396
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 137 transition count 396
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 78 place count 112 transition count 353
Iterating global reduction 2 with 25 rules applied. Total rules applied 103 place count 112 transition count 353
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 120 place count 112 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 111 transition count 336
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 121 place count 111 transition count 331
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 131 place count 106 transition count 331
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 105 transition count 329
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 105 transition count 329
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 151 place count 96 transition count 320
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 94 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 94 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 169 place count 94 transition count 299
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 92 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 91 transition count 296
Applied a total of 174 rules in 46 ms. Remains 91 /170 variables (removed 79) and now considering 296/429 (removed 133) transitions.
[2024-06-02 23:11:17] [INFO ] Flow matrix only has 293 transitions (discarded 3 similar events)
// Phase 1: matrix 293 rows 91 cols
[2024-06-02 23:11:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:11:17] [INFO ] Implicit Places using invariants in 130 ms returned [30, 60]
[2024-06-02 23:11:17] [INFO ] Actually due to overlaps returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/170 places, 296/429 transitions.
Graph (trivial) has 99 edges and 90 vertex of which 18 / 90 are part of one of the 7 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 76 transition count 211
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 76 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 76 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 75 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 75 transition count 202
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 75 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 74 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 73 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 73 transition count 190
Applied a total of 21 rules in 10 ms. Remains 73 /90 variables (removed 17) and now considering 190/296 (removed 106) transitions.
[2024-06-02 23:11:17] [INFO ] Flow matrix only has 146 transitions (discarded 44 similar events)
// Phase 1: matrix 146 rows 73 cols
[2024-06-02 23:11:17] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 23:11:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:11:17] [INFO ] Flow matrix only has 146 transitions (discarded 44 similar events)
[2024-06-02 23:11:17] [INFO ] Invariant cache hit.
[2024-06-02 23:11:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:11:17] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 73/170 places, 190/429 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 474 ms. Remains : 73/170 places, 190/429 transitions.
[2024-06-02 23:11:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:11:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:11:17] [INFO ] Input system was already deterministic with 190 transitions.
[2024-06-02 23:11:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:11:18] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:11:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10962799283828554640.gal : 8 ms
[2024-06-02 23:11:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3288167581346885454.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/CTLCardinality10962799283828554640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3288167581346885454.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,29194,0.172524,6528,2,1190,5,9402,6,0,475,8974,0


Converting to forward existential form...Done !
original formula: EG(A(!(((p3==0)||(p23==1))) U EF(!(((p16==0)||(p83==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U !(((p16==0)||(p83==1))))) U (!(!(((p3==0)||(p23==1)))) * !(E(TRUE U !(((p16==0)||(p83...221
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t12, t13, t16, t17, t21, t24, t28, t31, t35, t38, t42, t43, t45, t47, t49, t54, t56, ...320
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.91804,43688,1,0,447,187674,408,268,3731,209320,490
FORMULA MedleyA-PT-15-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-06-02 23:11:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:11:19] [INFO ] Flatten gal took : 15 ms
Total runtime 816533 ms.

BK_STOP 1717369880065

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="MedleyA-PT-15"
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 MedleyA-PT-15, 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 r576-smll-171734920000113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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