About the Execution of ITS-Tools for EGFr-PT-02010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 19673.00 | 0.00 | 0.00 | TTFFFTFFTFFTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068000730.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is EGFr-PT-02010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068000730
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 59K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-12
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-13
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-14
FORMULA_NAME EGFr-PT-02010-CTLFireability-2023-15
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748832889684
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 02:54:50] [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]
[2025-06-02 02:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:54:50] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2025-06-02 02:54:51] [INFO ] Transformed 40 places.
[2025-06-02 02:54:51] [INFO ] Transformed 68 transitions.
[2025-06-02 02:54:51] [INFO ] Found NUPN structural information;
[2025-06-02 02:54:51] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 40 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2025-06-02 02:54:51] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2025-06-02 02:54:51] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:51] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 02:54:51] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2025-06-02 02:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:54:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-02 02:54:51] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2025-06-02 02:54:51] [INFO ] Invariant cache hit.
[2025-06-02 02:54:51] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:51] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 7/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/107 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 126 constraints, problems are : Problem set: 9 solved, 56 unsolved in 1363 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/107 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 182 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1000 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2402ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 2424ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2732 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 40 out of 40 places after structural reductions.
[2025-06-02 02:54:53] [INFO ] Flatten gal took : 31 ms
[2025-06-02 02:54:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 02:54:54] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (1793 resets) in 1658 ms. (24 steps per ms) remains 30/61 properties
BEST_FIRST walk for 4003 steps (44 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (39 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (39 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (43 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (47 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (45 resets) in 55 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (41 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (36 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (38 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (39 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (45 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (48 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
[2025-06-02 02:54:54] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2025-06-02 02:54:54] [INFO ] Computed 20 invariants in 1 ms
[2025-06-02 02:54:54] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:54] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem AtomicPropp5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 7/63 constraints. Problems are: Problem set: 10 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem AtomicPropp54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/65 constraints. Problems are: Problem set: 11 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/65 constraints. Problems are: Problem set: 11 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 2/67 constraints. Problems are: Problem set: 11 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 2/69 constraints. Problems are: Problem set: 11 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/70 constraints. Problems are: Problem set: 11 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem AtomicPropp58 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 1/71 constraints. Problems are: Problem set: 12 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/71 constraints. Problems are: Problem set: 12 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 33/73 variables, 40/111 constraints. Problems are: Problem set: 12 solved, 18 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 19/130 constraints. Problems are: Problem set: 14 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/73 variables, 0/130 constraints. Problems are: Problem set: 14 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 130 constraints, problems are : Problem set: 14 solved, 16 unsolved in 828 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 13/45 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 5/50 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/50 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 6/38 variables, 6/56 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 6/62 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 4/66 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/66 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 32/70 variables, 38/104 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 16/120 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 13/133 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/133 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1/71 variables, 3/136 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/136 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 2/73 variables, 2/138 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 2/140 constraints. Problems are: Problem set: 14 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 1/141 constraints. Problems are: Problem set: 14 solved, 16 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 3/144 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 2/146 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 0/146 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/73 variables, 0/146 constraints. Problems are: Problem set: 15 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 146 constraints, problems are : Problem set: 15 solved, 15 unsolved in 462 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 16/30 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1308ms problems are : Problem set: 15 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 512 ms.
Support contains 27 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 52
Applied a total of 2 rules in 9 ms. Remains 38 /40 variables (removed 2) and now considering 52/53 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 38/40 places, 52/53 transitions.
RANDOM walk for 40000 steps (1930 resets) in 252 ms. (158 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (42 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (43 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (41 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (40 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (44 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
Probably explored full state space saw : 4196 states, properties seen :0
Probabilistic random walk after 24385 steps, saw 4196 distinct states, run finished after 135 ms. (steps per millisecond=180 ) properties seen :0
Explored full state space saw : 4196 states, properties seen :0
Exhaustive walk after 24385 steps, saw 4196 distinct states, run finished after 122 ms. (steps per millisecond=199 ) properties seen :0
Successfully simplified 30 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA EGFr-PT-02010-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 02:54:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 02:54:57] [INFO ] Flatten gal took : 6 ms
[2025-06-02 02:54:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 02:54:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-02010-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 02:54:57] [INFO ] Flatten gal took : 6 ms
FORMULA EGFr-PT-02010-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 02:54:57] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 32 out of 40 places (down from 35) after GAL structural reductions.
Computed a total of 14 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-02 02:54:57] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2025-06-02 02:54:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 02:54:57] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2025-06-02 02:54:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:54:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2025-06-02 02:54:57] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2025-06-02 02:54:57] [INFO ] Invariant cache hit.
[2025-06-02 02:54:57] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:57] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 133 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1373 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 49/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 182 constraints, problems are : Problem set: 1 solved, 49 unsolved in 864 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2246ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 2247ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2379 ms. Remains : 40/40 places, 52/53 transitions.
[2025-06-02 02:54:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 02:54:59] [INFO ] Flatten gal took : 4 ms
[2025-06-02 02:54:59] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 02:54:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:54:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:54:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4637980060776104492.gal : 2 ms
[2025-06-02 02:54:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16245425647156054381.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4637980060776104492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16245425647156054381.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4200,0.019115,4148,2,190,5,1452,6,0,191,1106,0
Converting to forward existential form...Done !
original formula: (AF(!(A(EX(((((CDK4_equals_1==1)&&(CDK6_equals_1==1))&&((pRB1_equals_0==1)&&(ERBB2_3_equals_1==1)))&&(IGF1R_equals_1==1))) U !(AX(FALSE))...259
=> equivalent forward existential formula: ([FwdG(Init,!(!(!((E(!(!(!(EX(!(FALSE))))) U (!(EX(((((CDK4_equals_1==1)&&(CDK6_equals_1==1))&&((pRB1_equals_0==...518
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t8, t10, t12, t13, t17, t19, t20, t23, t24, t25, t26, t27, t32, t33, t34,...304
(forward)formula 0,0,0.11724,9524,1,0,257,33454,122,106,1228,37072,246
FORMULA EGFr-PT-02010-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 11 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2025-06-02 02:54:59] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 33 cols
[2025-06-02 02:54:59] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 02:54:59] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:54:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 02:54:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:54:59] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 02:54:59] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:54:59] [INFO ] Invariant cache hit.
[2025-06-02 02:54:59] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:59] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:59] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:00] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/53 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:00] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/63 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 69 constraints, problems are : Problem set: 1 solved, 43 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/54 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 43/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 112 constraints, problems are : Problem set: 1 solved, 43 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 43/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1310ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1311ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 33/40 places, 47/53 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:01] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 1417 ms. Remains : 33/40 places, 47/53 transitions.
[2025-06-02 02:55:01] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:01] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:01] [INFO ] Input system was already deterministic with 47 transitions.
[2025-06-02 02:55:01] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:01] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9293605161645606558.gal : 1 ms
[2025-06-02 02:55:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13126660200311194044.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9293605161645606558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13126660200311194044.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2639,0.010368,4168,2,143,5,1210,6,0,169,867,0
Converting to forward existential form...Done !
original formula: EF(EG((((ERBB2_3_equals_1==1)&&(IGF1R_equals_1==1))||((MYC_equals_1==1)&&(p21_equals_1==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((ERBB2_3_equals_1==1)&&(IGF1R_equals_1==1))||((MYC_equals_1==1)&&(p21_equals_1==1))))] !...162
dead was empty
(forward)formula 0,0,0.032071,5192,1,0,27,7149,12,2,877,6084,25
FORMULA EGFr-PT-02010-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-02 02:55:01] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2025-06-02 02:55:01] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 02:55:01] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2025-06-02 02:55:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:55:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2025-06-02 02:55:01] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2025-06-02 02:55:01] [INFO ] Invariant cache hit.
[2025-06-02 02:55:01] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:01] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 133 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1352 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 49/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 182 constraints, problems are : Problem set: 1 solved, 49 unsolved in 834 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2195ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 2196ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2297 ms. Remains : 40/40 places, 52/53 transitions.
[2025-06-02 02:55:03] [INFO ] Flatten gal took : 9 ms
[2025-06-02 02:55:03] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:03] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 02:55:03] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:03] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15190853335589300083.gal : 1 ms
[2025-06-02 02:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11652537870269674727.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15190853335589300083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11652537870269674727.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4200,0.010887,4184,2,190,5,1452,6,0,191,1106,0
Converting to forward existential form...Done !
original formula: (AX(FALSE) + !(E((AX(((AKT1_0==1)&&(ERBB1_3_equals_1==1))) + ((AX(((AKT1_equals_1==1)&&(ERalpha_equals_0==1))) * (EGF_equals_1==1)) * ((E...313
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(FALSE))))),(!(EX(!(((AKT1_0==1)&&(ERBB1_3_equals_1==1))))) + ((!(EX(!(((AKT1_equals_1==1...376
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t8, t10, t12, t13, t17, t19, t20, t23, t24, t25, t26, t27, t32, t33, t34,...304
(forward)formula 0,0,0.06256,7256,1,0,149,19739,121,53,1237,17129,137
FORMULA EGFr-PT-02010-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 36 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 34 transition count 50
Applied a total of 5 rules in 5 ms. Remains 34 /40 variables (removed 6) and now considering 50/53 (removed 3) transitions.
[2025-06-02 02:55:03] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
// Phase 1: matrix 30 rows 34 cols
[2025-06-02 02:55:03] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 02:55:03] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-02 02:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 02:55:03] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:03] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-02 02:55:03] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-02 02:55:03] [INFO ] Invariant cache hit.
[2025-06-02 02:55:03] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:03] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:03] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/90 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 15/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 105 constraints, problems are : Problem set: 1 solved, 45 unsolved in 719 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/90 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 15/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 45/150 constraints. Problems are: Problem set: 1 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 151 constraints, problems are : Problem set: 1 solved, 45 unsolved in 699 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 1425ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 34/40 places, 49/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:05] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 1523 ms. Remains : 34/40 places, 49/53 transitions.
[2025-06-02 02:55:05] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:05] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:05] [INFO ] Input system was already deterministic with 49 transitions.
[2025-06-02 02:55:05] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:05] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2904837126629108686.gal : 1 ms
[2025-06-02 02:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3376401087819179931.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2904837126629108686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3376401087819179931.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2639,0.010571,4152,2,147,5,1358,6,0,173,944,0
Converting to forward existential form...Done !
original formula: A((((((ERBB1_3_equals_1==1)&&(MEK1_equals_0==1))&&((CDK2_equals_1==1)&&(p27_equals_1==1)))||((MYC_equals_1==1)&&(p27_equals_1==1)))||((((...419
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((CDK2_equals_1==1)&&(p21_equals_1==1))||((ERalpha_equals_1==1)&&(MYC_equals_0==1))))))...692
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t8, t10, t12, t13, t17, t19, t22, t23, t24, t29, t30, t31, t32, t33, t34,...289
(forward)formula 0,0,0.076059,8120,1,0,222,21282,111,111,1141,25707,236
FORMULA EGFr-PT-02010-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2025-06-02 02:55:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2025-06-02 02:55:05] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 02:55:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:05] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:55:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 02:55:05] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:55:05] [INFO ] Invariant cache hit.
[2025-06-02 02:55:05] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 90 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 137 constraints, problems are : Problem set: 1 solved, 47 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1983ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1983ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2074 ms. Remains : 39/40 places, 50/53 transitions.
[2025-06-02 02:55:07] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:07] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:07] [INFO ] Input system was already deterministic with 50 transitions.
[2025-06-02 02:55:07] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:55:07] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3454807075437731241.gal : 1 ms
[2025-06-02 02:55:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10159145041287523430.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3454807075437731241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10159145041287523430.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4200,0.011812,4168,2,178,5,1359,6,0,187,1038,0
Converting to forward existential form...Done !
original formula: EG(EX((EF((((AKT1_0==1)&&(CDK4_equals_0==1))&&((MYC_equals_0==1)&&(p21_equals_0==1)))) * AG(EX((EGF_equals_0==0))))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U (((AKT1_0==1)&&(CDK4_equals_0==1))&&((MYC_equals_0==1)&&(p21_equals_0==1)))) * !(E(TRUE ...196
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t19, t22, t23, t24, t25, t26, t31, t32, t33, t34,...294
dead was empty
(forward)formula 0,0,0.075494,7752,1,0,178,22915,110,71,1206,22750,198
FORMULA EGFr-PT-02010-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Applied a total of 1 rules in 6 ms. Remains 38 /40 variables (removed 2) and now considering 52/53 (removed 1) transitions.
[2025-06-02 02:55:07] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
// Phase 1: matrix 32 rows 38 cols
[2025-06-02 02:55:07] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 02:55:07] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2025-06-02 02:55:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 02:55:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:07] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-02 02:55:07] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2025-06-02 02:55:07] [INFO ] Invariant cache hit.
[2025-06-02 02:55:07] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:07] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:07] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 5/58 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 32/70 variables, 38/100 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 16/116 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 116 constraints, problems are : Problem set: 1 solved, 46 unsolved in 851 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 17/53 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 5/58 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 32/70 variables, 38/100 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 16/116 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 46/162 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 162 constraints, problems are : Problem set: 1 solved, 46 unsolved in 757 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 46/47 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1616ms problems are : Problem set: 1 solved, 46 unsolved
Search for dead transitions found 1 dead transitions in 1616ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 38/40 places, 51/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:09] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 1737 ms. Remains : 38/40 places, 51/53 transitions.
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 4 ms
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 4 ms
[2025-06-02 02:55:09] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 2 ms
[2025-06-02 02:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7103118777318990937.gal : 0 ms
[2025-06-02 02:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13844926380815010153.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7103118777318990937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13844926380815010153.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4196,0.020516,4180,2,178,5,1386,6,0,185,1039,0
Converting to forward existential form...Done !
original formula: AF((!(A(!((AF(((((AKT1_0==1)&&(CDK2_equals_0==1))&&((CDK4_equals_0==1)&&(MYC_equals_0==1)))&&(p27_equals_0==1))) + E((((ERBB1_equals_1==1...415
=> equivalent forward existential formula: [FwdG(Init,!((!(!((E(!(!(E(TRUE U !(E(TRUE U ((AKT1_0==1)&&(ERBB1_2_equals_1==1))))))) U (!(!((!(EG(!(((((AKT1_0...637
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t8, t10, t12, t13, t17, t19, t22, t23, t24, t25, t26, t31, t32, t33, t34,...299
dead was empty
(forward)formula 0,1,0.131643,10196,1,0,307,36496,122,151,1214,43702,362
FORMULA EGFr-PT-02010-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 9 ms
[2025-06-02 02:55:09] [INFO ] Flatten gal took : 2 ms
Total runtime 18449 ms.
BK_STOP 1748832909357
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EGFr-PT-02010"
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-5832"
echo " Executing tool itstools"
echo " Input is EGFr-PT-02010, 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 r072-tall-174860068000730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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.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 '
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 ;