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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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 28K 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-04-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352650121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:24:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:24:13] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-06-02 18:24:13] [INFO ] Transformed 115 places.
[2024-06-02 18:24:13] [INFO ] Transformed 107 transitions.
[2024-06-02 18:24:13] [INFO ] Found NUPN structural information;
[2024-06-02 18:24:13] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 80 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 113 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 113 transition count 106
Applied a total of 3 rules in 56 ms. Remains 113 /115 variables (removed 2) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 113 cols
[2024-06-02 18:24:13] [INFO ] Computed 8 invariants in 29 ms
[2024-06-02 18:24:13] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-02 18:24:13] [INFO ] Invariant cache hit.
[2024-06-02 18:24:14] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-02 18:24:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 17 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 3 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 3 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:18] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:18] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 106/219 variables, 113/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 3 ms to minimize.
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 10 ms to minimize.
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 158 constraints, problems are : Problem set: 0 solved, 105 unsolved in 8851 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:23] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:23] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 106/219 variables, 113/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 268 constraints, problems are : Problem set: 0 solved, 105 unsolved in 8084 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 42/42 constraints]
After SMT, in 17099ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 17124ms
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 106/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18006 ms. Remains : 113/115 places, 106/107 transitions.
Support contains 80 out of 113 places after structural reductions.
[2024-06-02 18:24:31] [INFO ] Flatten gal took : 65 ms
[2024-06-02 18:24:31] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:24:31] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 77 out of 113 places (down from 80) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (1112 resets) in 2839 ms. (14 steps per ms) remains 25/68 properties
BEST_FIRST walk for 4003 steps (32 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (35 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (33 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (30 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
[2024-06-02 18:24:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/102 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 106/210 variables, 104/112 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 7 (OVERLAPS) 9/219 variables, 9/121 constraints. Problems are: Problem set: 6 solved, 19 unsolved
[2024-06-02 18:24:33] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:24:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:24:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:24:33] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
Problem AtomicPropp39 is UNSAT
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 7/128 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 128 constraints, problems are : Problem set: 8 solved, 17 unsolved in 1452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 8 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 73/97 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 5/12 constraints. Problems are: Problem set: 8 solved, 17 unsolved
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 4/16 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/99 variables, 1/17 constraints. Problems are: Problem set: 8 solved, 17 unsolved
[2024-06-02 18:24:34] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 106/205 variables, 99/117 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 5/122 constraints. Problems are: Problem set: 8 solved, 17 unsolved
[2024-06-02 18:24:35] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/123 constraints. Problems are: Problem set: 8 solved, 17 unsolved
[2024-06-02 18:24:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/124 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/124 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 14/219 variables, 14/138 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 12/150 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 2/152 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/219 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 152 constraints, problems are : Problem set: 8 solved, 17 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 17/25 constraints, Known Traps: 14/14 constraints]
After SMT, in 3134ms problems are : Problem set: 8 solved, 17 unsolved
Parikh walk visited 0 properties in 2521 ms.
Support contains 24 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 106/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 113 transition count 89
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 96 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 93 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 93 transition count 80
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 87 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 57 place count 82 transition count 75
Iterating global reduction 3 with 5 rules applied. Total rules applied 62 place count 82 transition count 75
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 92 place count 67 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 67 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 66 transition count 59
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 64 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 63 transition count 57
Applied a total of 100 rules in 48 ms. Remains 63 /113 variables (removed 50) and now considering 57/106 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 63/113 places, 57/106 transitions.
RANDOM walk for 40000 steps (2735 resets) in 334 ms. (119 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40002 steps (1103 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (979 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1039 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1109 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1110 resets) in 292 ms. (136 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1122 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1067 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1135 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1118 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1111 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1132 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (880 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1115 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1117 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
// Phase 1: matrix 57 rows 63 cols
[2024-06-02 18:24:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:24:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 55/98 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 22/120 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-02 18:24:39] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 17 ms to minimize.
[2024-06-02 18:24:39] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 76 constraints, problems are : Problem set: 0 solved, 14 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/43 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 55/98 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 22/120 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 14 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints]
After SMT, in 1385ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 10734 ms.
Support contains 18 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 57/57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 56
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 2 with 6 rules applied. Total rules applied 8 place count 59 transition count 53
Applied a total of 8 rules in 8 ms. Remains 59 /63 variables (removed 4) and now considering 53/57 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/63 places, 53/57 transitions.
RANDOM walk for 40000 steps (2887 resets) in 176 ms. (225 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1206 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1069 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1156 resets) in 64 ms. (615 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1216 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1224 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1240 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1195 resets) in 66 ms. (597 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1207 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1208 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1208 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1214 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (944 resets) in 57 ms. (689 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1218 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1200 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
Probably explored full state space saw : 54592 states, properties seen :12
Probabilistic random walk after 200556 steps, saw 54592 distinct states, run finished after 839 ms. (steps per millisecond=239 ) properties seen :12
Explored full state space saw : 54592 states, properties seen :0
Exhaustive walk after 200556 steps, saw 54592 distinct states, run finished after 556 ms. (steps per millisecond=360 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:24:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:24:53] [INFO ] Flatten gal took : 12 ms
FORMULA MedleyA-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:24:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:24:53] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 57 out of 113 places (down from 63) after GAL structural reductions.
Computed a total of 113 stabilizing places and 106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113 transition count 106
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA MedleyA-PT-04-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 112 transition count 89
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 36 place count 96 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 92 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 92 transition count 80
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 87 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 82 transition count 75
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 82 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 82 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 81 transition count 74
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 90 place count 67 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 67 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 66 transition count 59
Applied a total of 92 rules in 37 ms. Remains 66 /113 variables (removed 47) and now considering 59/106 (removed 47) transitions.
// Phase 1: matrix 59 rows 66 cols
[2024-06-02 18:24:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:24:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:24:53] [INFO ] Invariant cache hit.
[2024-06-02 18:24:53] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 18:24:53] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-02 18:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:24:54] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 59/124 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/125 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 59/124 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 58/137 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:24:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/125 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 139 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3506 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
After SMT, in 5298ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5300ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/113 places, 59/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5513 ms. Remains : 66/113 places, 59/106 transitions.
[2024-06-02 18:24:59] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:59] [INFO ] Input system was already deterministic with 59 transitions.
[2024-06-02 18:24:59] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:59] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6536452871107937584.gal : 4 ms
[2024-06-02 18:24:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3026825940452160184.ctl : 3 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/CTLFireability6536452871107937584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3026825940452160184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.57023e+06,0.062027,4048,2,880,5,3389,6,0,325,2799,0


Converting to forward existential form...Done !
original formula: AG((((!(E((p82==1) U (p50==1))) + (p61!=1)) + ((p38!=1)||(p24!=1))) + ((p87==0) + (AG((p21==1)) * !(E((p83==1) U (p60==1)))))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!(E((p82==1) U (p50==1))) + (p61!=1)) + ((p38!=1)||(p24!=1))))) * !((p87==0))),T...327
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t9, t10, t12, t13, t17, t18, t19, t20, t51, Intersection with reachable at each step...212
Hit Full ! (commute/partial/dont) 31/0/28
(forward)formula 0,0,0.690324,20156,1,0,225,110603,150,107,2080,107419,214
FORMULA MedleyA-PT-04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 92
Applied a total of 28 rules in 16 ms. Remains 99 /113 variables (removed 14) and now considering 92/106 (removed 14) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:24:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:00] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:25:00] [INFO ] Invariant cache hit.
[2024-06-02 18:25:00] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:25:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:25:01] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:25:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/191 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:15] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 217 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16166 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
After SMT, in 21756ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 21757ms
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 92/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22018 ms. Remains : 99/113 places, 92/106 transitions.
[2024-06-02 18:25:21] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:21] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:21] [INFO ] Input system was already deterministic with 92 transitions.
[2024-06-02 18:25:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17628738435583284788.gal : 4 ms
[2024-06-02 18:25:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4025192375159390136.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/CTLFireability17628738435583284788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4025192375159390136.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,4.15729e+07,0.047337,4768,2,1677,5,5572,6,0,490,4523,0


Converting to forward existential form...Done !
original formula: E(AX(AF(!(AF((p48==1))))) U AG((p60==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EG(!(!(!(EG(!((p48==1)))))))))))) * !(E(TRUE U !((p60==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t29, t32, t34, t36, t41, t43, t48, t51, t78, t86, Inter...247
(forward)formula 0,0,0.83052,26368,1,0,202,130657,206,91,2881,95593,197
FORMULA MedleyA-PT-04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 112 transition count 86
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 93 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 91 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 42 place count 91 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 86 transition count 79
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 82 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 82 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 92 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 63 transition count 57
Applied a total of 96 rules in 22 ms. Remains 63 /113 variables (removed 50) and now considering 57/106 (removed 49) transitions.
// Phase 1: matrix 57 rows 63 cols
[2024-06-02 18:25:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:25:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:25:22] [INFO ] Invariant cache hit.
[2024-06-02 18:25:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-02 18:25:23] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-02 18:25:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 57/120 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 74 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1750 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 57/120 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 54/128 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 128 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 4/4 constraints]
After SMT, in 4604ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 4605ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/113 places, 57/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4782 ms. Remains : 63/113 places, 57/106 transitions.
[2024-06-02 18:25:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:27] [INFO ] Input system was already deterministic with 57 transitions.
[2024-06-02 18:25:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2347037202283544527.gal : 2 ms
[2024-06-02 18:25:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17790173947713068382.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/CTLFireability2347037202283544527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17790173947713068382.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,362644,0.030644,4104,2,682,5,2933,6,0,309,2076,0


Converting to forward existential form...Done !
original formula: AG((((AF(E(((p84==1)&&(p114==1)) U ((p84==1)&&(p109==1)))) + E(((p84==1)&&(p93==1)) U (p20==1))) + ((p61==1)||(p52==1))) + ((((p84==1)&&(...213
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((((p84==1)&&(p111==1))||((p84==1)&&(p106==1)))||((p84==1)&&(p91==1))))) * !(((p61=...274
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t7, t9, t14, t41, t44, t45, t49, Intersection with reachable at each step enable...205
(forward)formula 0,0,0.690356,20072,1,0,689,96965,148,91,1961,88089,674
FORMULA MedleyA-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 92
Applied a total of 28 rules in 5 ms. Remains 99 /113 variables (removed 14) and now considering 92/106 (removed 14) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:25:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:25:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:25:28] [INFO ] Invariant cache hit.
[2024-06-02 18:25:28] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:25:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:25:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:25:31] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5760 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:25:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:36] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:25:36] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:25:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 92/191 variables, 99/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 91/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:37] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 226 constraints, problems are : Problem set: 0 solved, 91 unsolved in 12713 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 28/28 constraints]
After SMT, in 18498ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 18500ms
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 92/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18689 ms. Remains : 99/113 places, 92/106 transitions.
[2024-06-02 18:25:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:47] [INFO ] Input system was already deterministic with 92 transitions.
[2024-06-02 18:25:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:47] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13664542670075386973.gal : 4 ms
[2024-06-02 18:25:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8900970178480845097.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/CTLFireability13664542670075386973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8900970178480845097.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,4.20545e+07,0.045946,4776,2,1695,5,5671,6,0,490,4534,0


Converting to forward existential form...Done !
original formula: A((EF(EX((p49==1))) + AG((p64==1))) U E(E(AX(((p84==1)&&(p94==1))) U (AX((p70==1)) * EF((p53==1)))) U EX(AX(((p62==1)&&(p69==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(E(!(EX(!(((p84==1)&&(p94==1))))) U (!(EX(!((p70==1)))) * E(TRUE U (p53==1)))) U EX(!(EX(!(((p...503
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t15, t18, t20, t22, t27, t29, t34, t36, t41, t43, t48, t51, t78, t86, Inter...247
(forward)formula 0,0,10.125,291428,1,0,1430,1.81848e+06,225,241,3029,2.11391e+06,1418
FORMULA MedleyA-PT-04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 112 transition count 86
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 93 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 92 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 92 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 86 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 59 place count 79 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 66 place count 79 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 79 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 78 transition count 71
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 96 place count 64 transition count 57
Applied a total of 96 rules in 16 ms. Remains 64 /113 variables (removed 49) and now considering 57/106 (removed 49) transitions.
// Phase 1: matrix 57 rows 64 cols
[2024-06-02 18:25:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:57] [INFO ] Implicit Places using invariants in 74 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/113 places, 57/106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 56
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 62 cols
[2024-06-02 18:25:57] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:25:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:25:57] [INFO ] Invariant cache hit.
[2024-06-02 18:25:57] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/113 places, 56/106 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 302 ms. Remains : 62/113 places, 56/106 transitions.
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:57] [INFO ] Input system was already deterministic with 56 transitions.
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14672240721283357126.gal : 2 ms
[2024-06-02 18:25:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17919055400594663518.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/CTLFireability14672240721283357126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17919055400594663518.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,454554,0.037466,4096,2,741,5,3094,6,0,305,2308,0


Converting to forward existential form...Done !
original formula: EF(!(E(!(((p51==1)&&(p58==1))) U !(E((p50==1) U (p2==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(((p51==1)&&(p58==1))) U !(E((p50==1) U (p2==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t9, t13, t17, t49, t50, t51, Intersection with reachable at each step enabled. (...200
(forward)formula 0,0,0.274214,9640,1,0,136,34675,137,62,1917,26891,137
FORMULA MedleyA-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 95
Applied a total of 22 rules in 8 ms. Remains 102 /113 variables (removed 11) and now considering 95/106 (removed 11) transitions.
// Phase 1: matrix 95 rows 102 cols
[2024-06-02 18:25:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:25:58] [INFO ] Invariant cache hit.
[2024-06-02 18:25:58] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-06-02 18:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 3 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:25:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:26:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:26:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:26:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:26:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:00] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/197 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:01] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:26:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:03] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:04] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 3 ms to minimize.
[2024-06-02 18:26:05] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/197 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:26:06] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:26:06] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:26:06] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 4 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 147 constraints, problems are : Problem set: 0 solved, 94 unsolved in 12247 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/197 variables, 102/148 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 94/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:26:12] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:26:12] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:26:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 245 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10921 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 41/41 constraints]
After SMT, in 23203ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 23205ms
Starting structural reductions in LTL mode, iteration 1 : 102/113 places, 95/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23441 ms. Remains : 102/113 places, 95/106 transitions.
[2024-06-02 18:26:21] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:26:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:26:21] [INFO ] Input system was already deterministic with 95 transitions.
[2024-06-02 18:26:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:26:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:26:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7453447273311850970.gal : 2 ms
[2024-06-02 18:26:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6506267598758036680.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/CTLFireability7453447273311850970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6506267598758036680.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,4.33729e+07,0.066115,4788,2,1748,5,5604,6,0,505,4444,0


Converting to forward existential form...Done !
original formula: AF(((E(AF(((p84==1)&&(p90==1))) U ((A((p14==1) U (p37==1)) * (p83==1)) * (p83==1))) * (p30==1)) * (AG((EF((p50!=1)) + !(E(((p84==1)&&(p97...237
=> equivalent forward existential formula: [FwdG(Init,!(((E(!(EG(!(((p84==1)&&(p90==1))))) U ((!((E(!((p37==1)) U (!((p14==1)) * !((p37==1)))) + EG(!((p37=...369
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t11, t13, t15, t20, t22, t27, t29, t34, t37, t40, t43, t45, t46, t49, t50, t80, t...262
(forward)formula 0,0,13.8414,382500,1,0,1973,2.44057e+06,241,532,3240,2.80568e+06,1980
FORMULA MedleyA-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 112 transition count 89
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 96 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 32 place count 96 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 90 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 83 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 83 transition count 76
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 69 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 69 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 68 transition count 61
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 67 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 66 transition count 60
Applied a total of 91 rules in 25 ms. Remains 66 /113 variables (removed 47) and now considering 60/106 (removed 46) transitions.
// Phase 1: matrix 60 rows 66 cols
[2024-06-02 18:26:35] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:26:35] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:26:35] [INFO ] Invariant cache hit.
[2024-06-02 18:26:35] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-02 18:26:35] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 18:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-02 18:26:36] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:26:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 60/126 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-02 18:26:37] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 77 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 60/126 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 57/134 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 5787 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints]
After SMT, in 8429ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 8431ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/113 places, 60/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8604 ms. Remains : 66/113 places, 60/106 transitions.
[2024-06-02 18:26:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:26:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:26:43] [INFO ] Input system was already deterministic with 60 transitions.
[2024-06-02 18:26:44] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:26:44] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15874414276892279076.gal : 1 ms
[2024-06-02 18:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7825926237724477984.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/CTLFireability15874414276892279076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7825926237724477984.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (A((EG((p49==1)) + AG(AF(((p84==1)&&(p90==1))))) U AF(AG(((p84==1)&&(p90==1))))) * E(AF((A((p48==1) U A((p24==1) U ((p62==1)&&(p69==1))))...212
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!(EG(!(!(E(TRUE U !(((p84==1)&&(p90==1))))))))) U (!((EG((p49==1)) + !(E(TRUE U !(!(EG(!((...725
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t10, t11, t14, t16, t43, t55, Intersection with reachable at each step enabled. ...201
(forward)formula 0,0,3.0207,95064,1,0,1178,595169,174,306,2121,688371,1234
FORMULA MedleyA-PT-04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 112 transition count 85
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 91 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 42 place count 91 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 85 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 60 place count 79 transition count 72
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 79 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 79 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 78 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 60 transition count 54
Applied a total of 102 rules in 19 ms. Remains 60 /113 variables (removed 53) and now considering 54/106 (removed 52) transitions.
// Phase 1: matrix 54 rows 60 cols
[2024-06-02 18:26:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:26:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:26:47] [INFO ] Invariant cache hit.
[2024-06-02 18:26:47] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:26:47] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/114 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 72 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 54/113 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/114 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:26:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 126 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3870 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
After SMT, in 5825ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5826ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/113 places, 54/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6035 ms. Remains : 60/113 places, 54/106 transitions.
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:26:53] [INFO ] Input system was already deterministic with 54 transitions.
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:26:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1848825903067272548.gal : 2 ms
[2024-06-02 18:26:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7425471876832308557.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/CTLFireability1848825903067272548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7425471876832308557.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,480422,0.035215,4080,2,625,5,2797,6,0,296,2133,0


Converting to forward existential form...Done !
original formula: EG((p14==0))
=> equivalent forward existential formula: [FwdG(Init,(p14==0))] != FALSE
Hit Full ! (commute/partial/dont) 52/0/2
(forward)formula 0,1,0.585105,15752,1,0,546,69322,18,4,1511,54375,543
FORMULA MedleyA-PT-04-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 98 transition count 91
Applied a total of 30 rules in 4 ms. Remains 98 /113 variables (removed 15) and now considering 91/106 (removed 15) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:26:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:26:53] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 18:26:53] [INFO ] Invariant cache hit.
[2024-06-02 18:26:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:26:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:26:56] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:26:57] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:26:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:26:57] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:26:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:26:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:26:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:27:04] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 19824ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 19826ms
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 91/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20141 ms. Remains : 98/113 places, 91/106 transitions.
[2024-06-02 18:27:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:27:13] [INFO ] Flatten gal took : 5 ms
FORMULA MedleyA-PT-04-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:27:13] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:27:13] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 112 transition count 93
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 100 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 97 transition count 90
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 97 transition count 83
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 90 transition count 83
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 49 place count 85 transition count 78
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 85 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 78 place count 73 transition count 66
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 73 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 72 transition count 65
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 71 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 70 transition count 64
Applied a total of 83 rules in 14 ms. Remains 70 /113 variables (removed 43) and now considering 64/106 (removed 42) transitions.
// Phase 1: matrix 64 rows 70 cols
[2024-06-02 18:27:13] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:27:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:27:13] [INFO ] Invariant cache hit.
[2024-06-02 18:27:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-02 18:27:14] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-06-02 18:27:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-02 18:27:14] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:27:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:27:14] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:27:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 64/134 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 81 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 64/134 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 62/143 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-02 18:27:17] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:27:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:27:17] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 146 constraints, problems are : Problem set: 0 solved, 62 unsolved in 4768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
After SMT, in 6989ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6990ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/113 places, 64/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7159 ms. Remains : 70/113 places, 64/106 transitions.
[2024-06-02 18:27:21] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:27:21] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:21] [INFO ] Input system was already deterministic with 64 transitions.
[2024-06-02 18:27:21] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:21] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:27:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2598900810002834387.gal : 2 ms
[2024-06-02 18:27:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17140552195794166560.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/CTLFireability2598900810002834387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17140552195794166560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E(A((AF(((p84==1)&&(p100==1))) * E(((p70==1)||(p72==1)) U ((p50==1)||((p18==1)&&(p25==1))))) U EF(((A((p53==1) U ((p84==1)&&(p91==1))) ...243
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(E(TRUE U ((!((E(!(((p84==1)&&(p91==1))) U (!((p53==1)) * !(((p84==1)&&(p91==1))))) + EG(!...671
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t8, t12, t17, t44, t47, t48, t49, t54, t55, t56, Intersection with reachable at each...217
dead was empty
(forward)formula 0,1,4.34094,128280,1,0,2789,752494,183,1410,2246,937838,2810
FORMULA MedleyA-PT-04-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 106/106 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 88
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 94 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 94 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 88 transition count 81
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 82 transition count 75
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 82 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 88 place count 68 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 67 transition count 60
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 66 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 65 transition count 59
Applied a total of 92 rules in 11 ms. Remains 65 /113 variables (removed 48) and now considering 59/106 (removed 47) transitions.
// Phase 1: matrix 59 rows 65 cols
[2024-06-02 18:27:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:27:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:27:25] [INFO ] Invariant cache hit.
[2024-06-02 18:27:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 18:27:25] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 18:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 59/124 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 77 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 59/124 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 57/134 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 134 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3244 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints]
After SMT, in 5201ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5201ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/113 places, 59/106 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5380 ms. Remains : 65/113 places, 59/106 transitions.
[2024-06-02 18:27:30] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:27:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:27:30] [INFO ] Input system was already deterministic with 59 transitions.
[2024-06-02 18:27:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:27:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13800412163159946458.gal : 2 ms
[2024-06-02 18:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5014562718842510881.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/CTLFireability13800412163159946458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5014562718842510881.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,783703,0.03624,4120,2,766,5,3181,6,0,320,2268,0


Converting to forward existential form...Done !
original formula: AF(EG(!(A(((((p84==1)&&(p113==1))||(p64==1))&&(!((p51==1)&&(p58==1)))) U (p48==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!((E(!((p48==1)) U (!(((((p84==1)&&(p113==1))||(p64==1))&&(!((p51==1)&&(p58==1))))) * !((p48==...193
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t9, t11, t15, t42, t46, t52, Intersection with reachable at each step enabled. (...200
dead was empty
(forward)formula 0,1,1.54995,44556,1,0,861,260657,147,166,2019,291697,891
FORMULA MedleyA-PT-04-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:27:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:27:32] [INFO ] Flatten gal took : 5 ms
Total runtime 199981 ms.

BK_STOP 1717352852512

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-04"
export BK_EXAMINATION="CTLFireability"
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-04, examination is CTLFireability"
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-171734919800026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-04.tgz
mv MedleyA-PT-04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;