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-171734919800009.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 48K 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-02-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351522378

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:05:24] [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 18:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:05:24] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-02 18:05:24] [INFO ] Transformed 69 places.
[2024-06-02 18:05:24] [INFO ] Transformed 168 transitions.
[2024-06-02 18:05:24] [INFO ] Found NUPN structural information;
[2024-06-02 18:05:24] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 61 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Applied a total of 0 rules in 25 ms. Remains 69 /69 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 69 cols
[2024-06-02 18:05:25] [INFO ] Computed 9 invariants in 25 ms
[2024-06-02 18:05:25] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-06-02 18:05:25] [INFO ] Invariant cache hit.
[2024-06-02 18:05:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:05:26] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-02 18:05:26] [INFO ] Invariant cache hit.
[2024-06-02 18:05:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 19 ms to minimize.
[2024-06-02 18:05:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 4 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:05:29] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:31] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 162/231 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 60/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 222 constraints, problems are : Problem set: 0 solved, 161 unsolved in 11521 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 162/231 variables, 69/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 60/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 161/383 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:05:43] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 18:05:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 386 constraints, problems are : Problem set: 0 solved, 161 unsolved in 15060 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 18/18 constraints]
After SMT, in 27080ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 27113ms
Finished structural reductions in LTL mode , in 1 iterations and 28042 ms. Remains : 69/69 places, 162/162 transitions.
Support contains 61 out of 69 places after structural reductions.
[2024-06-02 18:05:53] [INFO ] Flatten gal took : 82 ms
[2024-06-02 18:05:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:05:53] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:05:53] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 59 out of 69 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 64
RANDOM walk for 40000 steps (3969 resets) in 3174 ms. (12 steps per ms) remains 24/64 properties
BEST_FIRST walk for 4003 steps (95 resets) in 117 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (94 resets) in 117 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (96 resets) in 93 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (96 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (104 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (89 resets) in 62 ms. (63 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (79 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (95 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (89 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (92 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (95 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (96 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (84 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (88 resets) in 21 ms. (181 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4004 steps (87 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (96 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (90 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (90 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (93 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2024-06-02 18:05:55] [INFO ] Invariant cache hit.
[2024-06-02 18:05:55] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (OVERLAPS) 35/59 variables, 6/30 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 35/65 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/68 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:05:55] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/73 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 3/76 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/66 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 7/85 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/67 variables, 1/86 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 1/87 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 3/90 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:05:56] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/67 variables, 2/92 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/67 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 161/228 variables, 67/159 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 60/219 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 3/231 variables, 2/221 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/231 variables, 2/223 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/231 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/231 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 223 constraints, problems are : Problem set: 2 solved, 14 unsolved in 2082 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 40/59 variables, 6/25 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 40/65 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 15/80 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 6 ms to minimize.
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/82 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/66 variables, 2/84 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 7/91 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:57] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/67 variables, 1/93 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 1/95 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:58] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/67 variables, 1/96 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/67 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 161/228 variables, 67/163 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 60/223 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 11/234 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 1/235 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 3/231 variables, 2/237 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/231 variables, 2/239 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/231 variables, 3/242 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:05:59] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/231 variables, 1/243 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/231 variables, 2/245 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:06:00] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/231 variables, 1/246 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:06:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/231 variables, 1/247 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:06:01] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/231 variables, 1/248 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:06:02] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/231 variables, 1/249 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/231 variables, 0/249 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 249 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5010 ms.
Refiners :[Domain max(s): 69/69 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 28/28 constraints]
After SMT, in 7125ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 288 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 58 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 58 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 25 place count 56 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 36 place count 56 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 36 place count 56 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 55 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 54 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 54 transition count 159
Applied a total of 41 rules in 80 ms. Remains 54 /69 variables (removed 15) and now considering 159/162 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 54/69 places, 159/162 transitions.
RANDOM walk for 40000 steps (5119 resets) in 512 ms. (77 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40003 steps (1531 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1297 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1319 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1343 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1347 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1353 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1329 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
// Phase 1: matrix 159 rows 54 cols
[2024-06-02 18:06:03] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 18:06:03] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 34/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:06:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 7/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 158/210 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 70/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/213 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 136 constraints, problems are : Problem set: 0 solved, 7 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 34/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:06:04] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 158/210 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 70/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/213 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 144 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1756ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 65 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:06:05] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:06:05] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 20 stabilizing places and 69 stable transitions
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 143
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 54 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 54 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 53 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 53 transition count 134
Applied a total of 32 rules in 9 ms. Remains 53 /69 variables (removed 16) and now considering 134/162 (removed 28) transitions.
// Phase 1: matrix 134 rows 53 cols
[2024-06-02 18:06:05] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 18:06:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:06:05] [INFO ] Invariant cache hit.
[2024-06-02 18:06:05] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:06:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-06-02 18:06:05] [INFO ] Invariant cache hit.
[2024-06-02 18:06:05] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:06:06] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 5 ms to minimize.
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:06:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/187 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 57/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 129 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5707 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/187 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 57/129 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 133/262 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:06:15] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:06:18] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:06:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/187 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 265 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 13/13 constraints]
After SMT, in 18051ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 18055ms
Starting structural reductions in LTL mode, iteration 1 : 53/69 places, 134/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18329 ms. Remains : 53/69 places, 134/162 transitions.
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:23] [INFO ] Input system was already deterministic with 134 transitions.
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:06:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6788482974664266801.gal : 10 ms
[2024-06-02 18:06:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12259715448305189991.ctl : 5 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/CTLCardinality6788482974664266801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12259715448305189991.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,363580,0.681462,14852,2,1884,5,41207,6,0,343,50185,0


Converting to forward existential form...Done !
original formula: (EX(A(AF(AG(((p47==0)||(p45==1)))) U AG(EX(TRUE)))) + EG((EX(((p63==0)&&(p48==1))) * ((p22==1)||((p57==0)&&(p46==1))))))
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!(E(TRUE U !(EX(TRUE)))))))) * !(E(!(!(E(TRUE U !(EX(TRUE))))) U (!(!(EG(!(!(E(TRUE U !(((...311
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t...451
Using saturation style SCC detection
(forward)formula 0,0,11.5706,264296,1,0,516,1.49818e+06,305,246,3333,1.33049e+06,603
FORMULA MedleyA-PT-02-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 140
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 51 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 51 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 114
Applied a total of 38 rules in 6 ms. Remains 50 /69 variables (removed 19) and now considering 114/162 (removed 48) transitions.
// Phase 1: matrix 114 rows 50 cols
[2024-06-02 18:06:35] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:06:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:06:35] [INFO ] Invariant cache hit.
[2024-06-02 18:06:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-02 18:06:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-02 18:06:35] [INFO ] Invariant cache hit.
[2024-06-02 18:06:35] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-02 18:06:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:06:36] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:06:36] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/164 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 113 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/164 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 113/226 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 226 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 8953ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 8955ms
Starting structural reductions in LTL mode, iteration 1 : 50/69 places, 114/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9135 ms. Remains : 50/69 places, 114/162 transitions.
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:06:44] [INFO ] Input system was already deterministic with 114 transitions.
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:06:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7858800342275145160.gal : 5 ms
[2024-06-02 18:06:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality932996541335985463.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/CTLCardinality7858800342275145160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality932996541335985463.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,417967,0.85638,18976,2,3007,5,53176,6,0,311,79153,0


Converting to forward existential form...Done !
original formula: EF(((AX(AF((p39==1))) * AG(E((p4==0) U (p32==0)))) * ((AG(((p43==0)||(p31==1))) + (p26==0)) + (p15==1))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(EX(!(!(EG(!((p39==1))))))) * !(E(TRUE U !(E((p4==0) U (p32==0))))))) * !(E(TRUE U !(((...423
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...435
(forward)formula 0,1,18.2376,369072,1,0,652,2.09481e+06,263,269,2943,2.03506e+06,737
FORMULA MedleyA-PT-02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 51 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 51 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 115
Applied a total of 38 rules in 13 ms. Remains 50 /69 variables (removed 19) and now considering 115/162 (removed 47) transitions.
// Phase 1: matrix 115 rows 50 cols
[2024-06-02 18:07:03] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:07:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:07:03] [INFO ] Invariant cache hit.
[2024-06-02 18:07:03] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-02 18:07:03] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-02 18:07:03] [INFO ] Invariant cache hit.
[2024-06-02 18:07:03] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:07:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/165 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 51/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 116 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3437 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/165 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 51/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 114/230 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:07:09] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 231 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8389 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 7/7 constraints]
After SMT, in 11928ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11931ms
Starting structural reductions in LTL mode, iteration 1 : 50/69 places, 115/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12137 ms. Remains : 50/69 places, 115/162 transitions.
[2024-06-02 18:07:15] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:07:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:07:15] [INFO ] Input system was already deterministic with 115 transitions.
[2024-06-02 18:07:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:07:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:07:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17363835993777782376.gal : 3 ms
[2024-06-02 18:07:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11351273461897734527.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/CTLCardinality17363835993777782376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11351273461897734527.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,339809,0.646994,14748,2,2066,5,37242,6,0,311,58184,0


Converting to forward existential form...Done !
original formula: EX(((EF(((EX(((p64==0)||(p33==1))) * ((p26==0)||(p59==1))) + EX(((p9==1)&&(p65==0))))) * AG(AF(((p27==0)||(p6==1))))) * ((p67==0)||(p44==...160
=> equivalent forward existential formula: [(((EY(Init) * ((p67==0)||(p44==1))) * E(TRUE U ((EX(((p64==0)||(p33==1))) * ((p26==0)||(p59==1))) + EX(((p9==1)...229
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...466
(forward)formula 0,0,4.74498,111360,1,0,538,572614,262,208,2901,606481,597
FORMULA MedleyA-PT-02-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 31 place count 51 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 51 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 48 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 48 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 44 place count 48 transition count 117
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 48 place count 46 transition count 117
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 0 with 2 rules applied. Total rules applied 50 place count 45 transition count 116
Applied a total of 50 rules in 24 ms. Remains 45 /69 variables (removed 24) and now considering 116/162 (removed 46) transitions.
// Phase 1: matrix 116 rows 45 cols
[2024-06-02 18:07:20] [INFO ] Computed 9 invariants in 5 ms
[2024-06-02 18:07:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:07:20] [INFO ] Invariant cache hit.
[2024-06-02 18:07:20] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 18:07:20] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 18:07:20] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2024-06-02 18:07:20] [INFO ] Invariant cache hit.
[2024-06-02 18:07:20] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:07:21] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:07:21] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:07:21] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:07:21] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:07:21] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:07:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/161 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 114 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5631 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/161 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 115/229 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:07:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/161 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:07:32] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/161 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 231 constraints, problems are : Problem set: 0 solved, 115 unsolved in 11552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 8/8 constraints]
After SMT, in 17262ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 17263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/69 places, 116/162 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17445 ms. Remains : 45/69 places, 116/162 transitions.
[2024-06-02 18:07:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:07:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:07:37] [INFO ] Input system was already deterministic with 116 transitions.
[2024-06-02 18:07:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:07:37] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:07:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10251314401758541409.gal : 4 ms
[2024-06-02 18:07:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9320216053401462464.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/CTLCardinality10251314401758541409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9320216053401462464.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,110805,0.453516,10828,2,1309,5,24139,6,0,294,39011,0


Converting to forward existential form...Done !
original formula: EG((AF((AG((p48!=1)) * !(A((p3==1) U (p36==0))))) + (p19==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((!(E(TRUE U !((p48!=1)))) * !(!((E(!((p36==0)) U (!((p3==1)) * !((p36==0)))) + EG(!((p36==0))...186
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t17, t18, t19, t20, t21, t22...407
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.90459,179708,1,0,574,956900,277,272,2828,990054,629
FORMULA MedleyA-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 49 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 48 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 48 transition count 112
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 0 with 2 rules applied. Total rules applied 39 place count 47 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 47 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 42 place count 47 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 46 transition count 107
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 0 with 4 rules applied. Total rules applied 48 place count 44 transition count 105
Applied a total of 48 rules in 25 ms. Remains 44 /69 variables (removed 25) and now considering 105/162 (removed 57) transitions.
// Phase 1: matrix 105 rows 44 cols
[2024-06-02 18:07:45] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:07:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:07:45] [INFO ] Invariant cache hit.
[2024-06-02 18:07:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 18:07:45] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-02 18:07:45] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 18:07:45] [INFO ] Invariant cache hit.
[2024-06-02 18:07:45] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:07:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:07:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:07:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 105/149 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 72 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 105/149 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 99/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 171 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
After SMT, in 6585ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6586ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/69 places, 105/162 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6764 ms. Remains : 44/69 places, 105/162 transitions.
[2024-06-02 18:07:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:07:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:07:52] [INFO ] Input system was already deterministic with 105 transitions.
[2024-06-02 18:07:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:07:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:07:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10508448588056036245.gal : 2 ms
[2024-06-02 18:07:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5431286018156740860.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/CTLCardinality10508448588056036245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5431286018156740860.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,142806,0.513084,12860,2,1832,5,33924,6,0,277,45733,0


Converting to forward existential form...Done !
original formula: AG(((p13==0) + EG((((((((p6==1)||(p30==0))||((p14==1)||(p39==0)))||(p14==1)) * (((p29==0)&&(p26==1)) + AG((p63==0)))) + (p38==0)) + (p13=...162
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p13==0))) * !(EG((((((((p6==1)||(p30==0))||((p14==1)||(p39==0)))||(p14==1)) * (((p29==0)...231
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...396
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.75359,202484,1,0,541,1.11633e+06,246,272,2617,1.05497e+06,553
FORMULA MedleyA-PT-02-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 52 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 52 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 130
Applied a total of 36 rules in 4 ms. Remains 51 /69 variables (removed 18) and now considering 130/162 (removed 32) transitions.
// Phase 1: matrix 130 rows 51 cols
[2024-06-02 18:08:01] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:08:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:08:01] [INFO ] Invariant cache hit.
[2024-06-02 18:08:01] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:08:01] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-02 18:08:01] [INFO ] Invariant cache hit.
[2024-06-02 18:08:01] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:08:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:08:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/181 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 57/124 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 124 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5495 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/181 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 57/124 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 129/253 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:08:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:08:09] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 258 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 11593ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 11595ms
Starting structural reductions in LTL mode, iteration 1 : 51/69 places, 130/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11766 ms. Remains : 51/69 places, 130/162 transitions.
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:12] [INFO ] Input system was already deterministic with 130 transitions.
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:08:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15413950039102819651.gal : 3 ms
[2024-06-02 18:08:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9828879008265079921.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/CTLCardinality15413950039102819651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9828879008265079921.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,321412,0.36439,13868,2,1744,5,33183,6,0,331,50822,0


Converting to forward existential form...Done !
original formula: E((EX(!(AF((((p63==0)||(p46==1))||(p26==1))))) * ((p55==1) + EG(AF(EX(TRUE))))) U AF(!(((p18==0)||(p24==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(EX(!(!(EG(!((((p63==0)||(p46==1))||(p26==1))))))) * ((p55==1) + EG(!(EG(!(EX(TRUE)))))))) * !(EG(!(...192
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...477
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,17.7566,397064,1,0,881,2.19564e+06,302,397,3184,2.344e+06,1040
FORMULA MedleyA-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Graph (complete) has 353 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 54 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 54 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 53 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 53 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 52 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 52 transition count 132
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 0 with 4 rules applied. Total rules applied 35 place count 50 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 50 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 39 place count 50 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 49 transition count 125
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 45 place count 47 transition count 123
Applied a total of 45 rules in 27 ms. Remains 47 /69 variables (removed 22) and now considering 123/162 (removed 39) transitions.
// Phase 1: matrix 123 rows 47 cols
[2024-06-02 18:08:30] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:08:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:08:30] [INFO ] Invariant cache hit.
[2024-06-02 18:08:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:08:31] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 18:08:31] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-02 18:08:31] [INFO ] Invariant cache hit.
[2024-06-02 18:08:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 18:08:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 18:08:33] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/170 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 56/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5097 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/170 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 56/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 122/242 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-02 18:08:39] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 243 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
After SMT, in 12209ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 12211ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/69 places, 123/162 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12473 ms. Remains : 47/69 places, 123/162 transitions.
[2024-06-02 18:08:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:08:43] [INFO ] Input system was already deterministic with 123 transitions.
[2024-06-02 18:08:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:08:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:08:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13359123974692972816.gal : 2 ms
[2024-06-02 18:08:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14096313512914904517.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/CTLCardinality13359123974692972816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14096313512914904517.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,142593,0.532064,13000,2,1730,5,28678,6,0,309,51040,0


Converting to forward existential form...Done !
original formula: AG(E(((p3!=1)||((p25==1)&&((p21==0)||(p39==1)))) U A(((p13==0)||(p50==1)) U ((p0==0)||(p22==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p3!=1)||((p25==1)&&((p21==0)||(p39==1)))) U !((E(!(((p0==0)||(p22==1))) U (!(((p13==0)...237
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21...432
(forward)formula 0,1,1.01821,20980,1,0,242,84390,277,76,2925,100597,267
FORMULA MedleyA-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 56 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 56 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 53 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 53 transition count 125
Applied a total of 32 rules in 4 ms. Remains 53 /69 variables (removed 16) and now considering 125/162 (removed 37) transitions.
// Phase 1: matrix 125 rows 53 cols
[2024-06-02 18:08:44] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:08:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:08:44] [INFO ] Invariant cache hit.
[2024-06-02 18:08:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 18:08:44] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-02 18:08:44] [INFO ] Invariant cache hit.
[2024-06-02 18:08:44] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:08:45] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:08:46] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:08:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 123 constraints, problems are : Problem set: 0 solved, 124 unsolved in 4876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 54/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 124/247 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:08:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:08:57] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:08:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:08:58] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 258 constraints, problems are : Problem set: 0 solved, 124 unsolved in 14037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 18/18 constraints]
After SMT, in 18979ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 18980ms
Starting structural reductions in LTL mode, iteration 1 : 53/69 places, 125/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19138 ms. Remains : 53/69 places, 125/162 transitions.
[2024-06-02 18:09:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:09:03] [INFO ] Input system was already deterministic with 125 transitions.
[2024-06-02 18:09:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:09:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13956690575293713822.gal : 2 ms
[2024-06-02 18:09:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6741178481060564092.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/CTLCardinality13956690575293713822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6741178481060564092.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,498025,0.735766,21704,2,3153,5,56111,6,0,334,91233,0


Converting to forward existential form...Done !
original formula: E(EX(((AF((p35==1)) + A((p32==1) U (p13==1))) + ((!(((p4==0)||(p13==1))||((!((p49==0)||(p39==1)))||(!((p61==1)&&((p3==0)||(p64==1)))))))|...202
=> equivalent forward existential formula: [(FwdU(Init,EX(((!(EG(!((p35==1)))) + !((E(!((p13==1)) U (!((p32==1)) * !((p13==1)))) + EG(!((p13==1)))))) + ((!...299
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21, t22, t...466
Detected timeout of ITS tools.
[2024-06-02 18:09:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:09:33] [INFO ] Applying decomposition
[2024-06-02 18:09:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15616849762547190289.txt' '-o' '/tmp/graph15616849762547190289.bin' '-w' '/tmp/graph15616849762547190289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15616849762547190289.bin' '-l' '-1' '-v' '-w' '/tmp/graph15616849762547190289.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:09:33] [INFO ] Decomposing Gal with order
[2024-06-02 18:09:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:09:33] [INFO ] Removed a total of 204 redundant transitions.
[2024-06-02 18:09:34] [INFO ] Flatten gal took : 85 ms
[2024-06-02 18:09:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 17 ms.
[2024-06-02 18:09:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality16976203312733250973.gal : 5 ms
[2024-06-02 18:09:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15006160458014866441.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/CTLCardinality16976203312733250973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15006160458014866441.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,498025,0.529467,13468,498,312,14451,1969,283,30760,123,17834,0


Converting to forward existential form...Done !
original formula: E(EX(((AF((i3.u3.p35==1)) + A((i3.u3.p32==1) U (i0.u1.p13==1))) + ((!(((i0.u1.p4==0)||(i0.u1.p13==1))||((!((i3.u7.p49==0)||(i2.u5.p39==1)...284
=> equivalent forward existential formula: [(FwdU(Init,EX(((!(EG(!((i3.u3.p35==1)))) + !((E(!((i0.u1.p13==1)) U (!((i3.u3.p32==1)) * !((i0.u1.p13==1)))) + ...393
Reverse transition relation is NOT exact ! Due to transitions t37, t44, t45, t101, t102, t103, t104, t105, t106, t107, t108, t120, t122, u2.t19, u2.t20, u2...573
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,6.15121,144940,1,0,222598,29152,1624,360409,666,158232,379665
FORMULA MedleyA-PT-02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 51 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 51 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 49 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 49 transition count 121
Applied a total of 40 rules in 4 ms. Remains 49 /69 variables (removed 20) and now considering 121/162 (removed 41) transitions.
// Phase 1: matrix 121 rows 49 cols
[2024-06-02 18:09:40] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:09:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:09:40] [INFO ] Invariant cache hit.
[2024-06-02 18:09:40] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 18:09:40] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-02 18:09:40] [INFO ] Invariant cache hit.
[2024-06-02 18:09:40] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:09:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/170 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4528 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/170 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 120/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 240 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4967 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 8/8 constraints]
After SMT, in 9561ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9562ms
Starting structural reductions in LTL mode, iteration 1 : 49/69 places, 121/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9739 ms. Remains : 49/69 places, 121/162 transitions.
[2024-06-02 18:09:49] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:50] [INFO ] Input system was already deterministic with 121 transitions.
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality11853492216883487425.gal : 2 ms
[2024-06-02 18:09:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16105801470651111972.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/CTLCardinality11853492216883487425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16105801470651111972.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,279796,0.405316,11416,2,1492,5,27927,6,0,314,40392,0


Converting to forward existential form...Done !
original formula: (AF(EG(((p33==0) * AX((p56==1))))) + (EX((AX((p40==0)) * AX(((p46==0)||(p60==1))))) * AG(((p67==1) + AG((p17==1))))))
=> equivalent forward existential formula: ([((Init * !(!(EG(!(EG(((p33==0) * !(EX(!((p56==1))))))))))) * !(EX((!(EX(!((p40==0)))) * !(EX(!(((p46==0)||(p60...301
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...433
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.1753,246308,1,0,725,1.28932e+06,276,393,3078,1.45598e+06,738
FORMULA MedleyA-PT-02-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 53 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 53 transition count 130
Applied a total of 32 rules in 3 ms. Remains 53 /69 variables (removed 16) and now considering 130/162 (removed 32) transitions.
// Phase 1: matrix 130 rows 53 cols
[2024-06-02 18:10:00] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 18:10:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:10:00] [INFO ] Invariant cache hit.
[2024-06-02 18:10:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:10:00] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-02 18:10:00] [INFO ] Invariant cache hit.
[2024-06-02 18:10:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:10:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/183 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 129 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/183 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 129/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-02 18:10:08] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:10:09] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 260 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7719 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 13/13 constraints]
After SMT, in 13960ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 13963ms
Starting structural reductions in LTL mode, iteration 1 : 53/69 places, 130/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14112 ms. Remains : 53/69 places, 130/162 transitions.
[2024-06-02 18:10:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:10:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:14] [INFO ] Input system was already deterministic with 130 transitions.
[2024-06-02 18:10:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality7373365845651140029.gal : 4 ms
[2024-06-02 18:10:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11068876152593817737.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/CTLCardinality7373365845651140029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11068876152593817737.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,419047,0.954435,19960,2,3100,5,54433,6,0,339,76579,0


Converting to forward existential form...Done !
original formula: E((AG(!(((p30==0)||(p20==1)))) * ((EF(AX(((p27==0)||(p24==1)))) + !(((p5==0)||(p31==1)))) + ((p46==0)||(p24==1)))) U AG((AF(((p0==0)||(p1...192
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(((p30==0)||(p20==1)))))) * ((E(TRUE U !(EX(!(((p27==0)||(p24==1)))))) + !(((p5==0)||...286
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t18, t20, t21, t22, t23, t...485
(forward)formula 0,1,4.04201,89068,1,0,296,440195,299,106,3228,408258,334
FORMULA MedleyA-PT-02-CTLCardinality-2024-09 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 : 69/69 places, 162/162 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 52 transition count 137
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 52 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 50 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 50 transition count 128
Applied a total of 38 rules in 5 ms. Remains 50 /69 variables (removed 19) and now considering 128/162 (removed 34) transitions.
// Phase 1: matrix 128 rows 50 cols
[2024-06-02 18:10:18] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:10:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:10:18] [INFO ] Invariant cache hit.
[2024-06-02 18:10:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:10:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-06-02 18:10:18] [INFO ] Invariant cache hit.
[2024-06-02 18:10:18] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-02 18:10:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:10:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:10:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-02 18:10:21] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-02 18:10:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-02 18:10:22] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:10:22] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 128/178 variables, 50/72 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 57/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 129 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-06-02 18:10:26] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/178 variables, 50/73 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 57/130 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 127/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 257 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6767 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 14/14 constraints]
After SMT, in 13421ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 13423ms
Starting structural reductions in LTL mode, iteration 1 : 50/69 places, 128/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13646 ms. Remains : 50/69 places, 128/162 transitions.
[2024-06-02 18:10:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:32] [INFO ] Input system was already deterministic with 128 transitions.
[2024-06-02 18:10:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13873098058553585073.gal : 2 ms
[2024-06-02 18:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15764785206472949609.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/CTLCardinality13873098058553585073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15764785206472949609.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,286468,0.288544,11472,2,1538,5,27917,6,0,325,39303,0


Converting to forward existential form...Done !
original formula: AX(EG(((p51==0) * (EF((p53==1)) + ((EF((p9==0)) * (p18==0)) * (p40==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((p51==0) * (E(TRUE U (p53==1)) + ((E(TRUE U (p9==0)) * (p18==0)) * (p40==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t21, t22, t23, t...489
Using saturation style SCC detection
(forward)formula 0,1,7.02617,173176,1,0,544,952139,289,256,3073,929370,590
FORMULA MedleyA-PT-02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 52 transition count 137
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 49 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 49 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 48 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 48 transition count 116
Applied a total of 42 rules in 5 ms. Remains 48 /69 variables (removed 21) and now considering 116/162 (removed 46) transitions.
// Phase 1: matrix 116 rows 48 cols
[2024-06-02 18:10:39] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:10:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:10:39] [INFO ] Invariant cache hit.
[2024-06-02 18:10:39] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:10:39] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-02 18:10:39] [INFO ] Invariant cache hit.
[2024-06-02 18:10:39] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/164 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 114 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:10:44] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/164 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 53/115 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 115/230 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:10:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-02 18:10:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:10:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 233 constraints, problems are : Problem set: 0 solved, 115 unsolved in 9416 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 8/8 constraints]
After SMT, in 13632ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 13634ms
Starting structural reductions in LTL mode, iteration 1 : 48/69 places, 116/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13805 ms. Remains : 48/69 places, 116/162 transitions.
[2024-06-02 18:10:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:10:53] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:53] [INFO ] Input system was already deterministic with 116 transitions.
[2024-06-02 18:10:53] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality11274864177689048404.gal : 2 ms
[2024-06-02 18:10:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5502088258564221412.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/CTLCardinality11274864177689048404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5502088258564221412.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,254152,0.315507,11100,2,1342,5,26193,6,0,305,38323,0


Converting to forward existential form...Done !
original formula: EG(E(EX(TRUE) U ((p62==0) + AX((p25==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(EX(TRUE) U ((p62==0) + !(EX(!((p25==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...417
(forward)formula 0,1,1.48466,33076,1,0,263,136774,257,110,2922,176985,297
FORMULA MedleyA-PT-02-CTLCardinality-2024-12 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 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 142
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 53 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 53 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 52 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 52 transition count 127
Applied a total of 34 rules in 5 ms. Remains 52 /69 variables (removed 17) and now considering 127/162 (removed 35) transitions.
// Phase 1: matrix 127 rows 52 cols
[2024-06-02 18:10:54] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:10:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:10:54] [INFO ] Invariant cache hit.
[2024-06-02 18:10:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 18:10:54] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-02 18:10:54] [INFO ] Invariant cache hit.
[2024-06-02 18:10:54] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:10:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:10:56] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:10:57] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:10:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:10:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:10:57] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/179 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 55/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 128 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6695 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:11:02] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/179 variables, 52/74 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 126/255 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:11:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:11:06] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-02 18:11:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:11:08] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:11:08] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:11:08] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:11:11] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 262 constraints, problems are : Problem set: 0 solved, 126 unsolved in 15653 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 20/20 constraints]
After SMT, in 22425ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 22427ms
Starting structural reductions in LTL mode, iteration 1 : 52/69 places, 127/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22589 ms. Remains : 52/69 places, 127/162 transitions.
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:17] [INFO ] Input system was already deterministic with 127 transitions.
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:11:17] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality5721752354199415693.gal : 16 ms
[2024-06-02 18:11:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3875195481612421109.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/CTLCardinality5721752354199415693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3875195481612421109.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,371983,0.455477,16732,2,2474,5,42640,6,0,332,64259,0


Converting to forward existential form...Done !
original formula: AX(((EF(((p32==0)||(p63==1))) * EF(AG(((p40==0)||(p44==1))))) * (EX(((p18==0)&&(p44==1))) * EG(EF(AG((p24==1)))))))
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U ((p32==0)||(p63==1)))))] = FALSE * [(EY(Init) * !(E(TRUE U !(E(TRUE U !(((p40==0)||(p4...300
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...494
(forward)formula 0,0,1.40792,36432,1,0,269,154520,283,81,3084,165115,283
FORMULA MedleyA-PT-02-CTLCardinality-2024-13 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 : 69/69 places, 162/162 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 53 transition count 139
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 53 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 50 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 50 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 49 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 49 transition count 118
Applied a total of 40 rules in 4 ms. Remains 49 /69 variables (removed 20) and now considering 118/162 (removed 44) transitions.
// Phase 1: matrix 118 rows 49 cols
[2024-06-02 18:11:18] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:11:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:11:18] [INFO ] Invariant cache hit.
[2024-06-02 18:11:18] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:11:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-06-02 18:11:18] [INFO ] Invariant cache hit.
[2024-06-02 18:11:18] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:11:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:11:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:11:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:11:19] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:11:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:11:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:11:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/167 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 118 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3708 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/167 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 117/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 235 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
After SMT, in 8321ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8323ms
Starting structural reductions in LTL mode, iteration 1 : 49/69 places, 118/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8476 ms. Remains : 49/69 places, 118/162 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:27] [INFO ] Input system was already deterministic with 118 transitions.
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2388297937413556526.gal : 1 ms
[2024-06-02 18:11:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6343424305587048447.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/CTLCardinality2388297937413556526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6343424305587048447.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,287008,0.458397,11380,2,1491,5,28920,6,0,311,38791,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(E((p52!=1) U (p64==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(E((p52!=1) U (p64==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t21, t22, t23, t...405
(forward)formula 0,1,1.60118,34368,1,0,308,161915,261,116,2898,158384,346
FORMULA MedleyA-PT-02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 55 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 55 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 52 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 51 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 51 transition count 120
Applied a total of 36 rules in 4 ms. Remains 51 /69 variables (removed 18) and now considering 120/162 (removed 42) transitions.
// Phase 1: matrix 120 rows 51 cols
[2024-06-02 18:11:28] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:11:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:11:28] [INFO ] Invariant cache hit.
[2024-06-02 18:11:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:11:29] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-02 18:11:29] [INFO ] Invariant cache hit.
[2024-06-02 18:11:29] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:11:30] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:11:30] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:11:30] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:11:30] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 117 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 119/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:11:35] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:11:38] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:11:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/171 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:11:41] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:11:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:11:43] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 242 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13280 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 10/10 constraints]
After SMT, in 17911ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 17914ms
Starting structural reductions in LTL mode, iteration 1 : 51/69 places, 120/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18156 ms. Remains : 51/69 places, 120/162 transitions.
[2024-06-02 18:11:47] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:47] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:47] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:11:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:11:47] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4571651019914956273.gal : 1 ms
[2024-06-02 18:11:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality3254964864610639757.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/CTLCardinality4571651019914956273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3254964864610639757.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,388534,0.509852,16940,2,2715,5,49480,6,0,321,59392,0


Converting to forward existential form...Done !
original formula: (EX((p12==0)) * E((AF(((p34!=1) * AX(((p65==0)||(p29==1))))) * EX(!(((A((p37==1) U (p57==0)) * ((p24==0)||(p38==1))) * (p7==1))))) U AX((...165
=> equivalent forward existential formula: [(FwdU((Init * EX((p12==0))),(!(EG(!(((p34!=1) * !(EX(!(((p65==0)||(p29==1))))))))) * EX(!(((!((E(!((p57==0)) U ...274
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...422
Using saturation style SCC detection
(forward)formula 0,0,11.7582,288848,1,0,716,1.74533e+06,285,356,3037,1.46795e+06,762
FORMULA MedleyA-PT-02-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:11:58] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:11:58] [INFO ] Flatten gal took : 5 ms
Total runtime 394461 ms.

BK_STOP 1717351919039

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-02"
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-02, 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-171734919800009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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