Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-2024-11
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

=== Now, execution of the tool begins

BK_START 1716402839281

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 202405141337
[2024-05-22 18:34:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 18:34:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:34:02] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-22 18:34:02] [INFO ] Transformed 40 places.
[2024-05-22 18:34:02] [INFO ] Transformed 68 transitions.
[2024-05-22 18:34:02] [INFO ] Found NUPN structural information;
[2024-05-22 18:34:02] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 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 29 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-22 18:34:02] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-22 18:34:02] [INFO ] Computed 20 invariants in 10 ms
[2024-05-22 18:34:03] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-22 18:34:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 18:34:03] [INFO ] Invariant cache hit.
[2024-05-22 18:34:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:03] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 18:34:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 18:34:03] [INFO ] Invariant cache hit.
[2024-05-22 18:34:03] [INFO ] State equation strengthened by 19 read => feed constraints.
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
[2024-05-22 18:34:03] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 12 ms to minimize.
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 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, 6/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2182 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: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
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, 6/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/125 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/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 181 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1495 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: 6/6 constraints]
After SMT, in 3793ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 3829ms
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 4469 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 40 out of 40 places after structural reductions.
[2024-05-22 18:34:07] [INFO ] Flatten gal took : 42 ms
[2024-05-22 18:34:07] [INFO ] Flatten gal took : 19 ms
[2024-05-22 18:34:07] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 56 to 54
RANDOM walk for 40000 steps (1791 resets) in 2398 ms. (16 steps per ms) remains 24/54 properties
BEST_FIRST walk for 4004 steps (45 resets) in 72 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 74 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (45 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (39 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (38 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (38 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (43 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (46 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (43 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
[2024-05-22 18:34:08] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:08] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:34:08] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 18:34:08] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/48 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 7/40 variables, 7/55 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 7/62 constraints. Problems are: Problem set: 2 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/102 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/121 constraints. Problems are: Problem set: 8 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 121 constraints, problems are : Problem set: 8 solved, 16 unsolved in 735 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: 24/24 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 9/36 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/38 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 9/36 variables, 9/47 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 9/56 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-22 18:34:09] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
[2024-05-22 18:34:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-05-22 18:34:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 3/59 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/59 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 31/67 variables, 36/95 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 14/109 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 8/117 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/117 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/69 variables, 4/121 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/69 variables, 1/122 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/69 variables, 0/122 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/73 variables, 4/126 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 4/130 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 2/132 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 3/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 0/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/73 variables, 0/135 constraints. Problems are: Problem set: 13 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 135 constraints, problems are : Problem set: 13 solved, 11 unsolved in 739 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: 11/24 constraints, Known Traps: 5/5 constraints]
After SMT, in 1521ms problems are : Problem set: 13 solved, 11 unsolved
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 883 ms.
Support contains 24 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
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 36 transition count 51
Applied a total of 4 rules in 32 ms. Remains 36 /40 variables (removed 4) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 36/40 places, 51/53 transitions.
RANDOM walk for 40000 steps (2047 resets) in 416 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (522 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (526 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (507 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (486 resets) in 222 ms. (179 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (471 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (470 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (474 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (467 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (478 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (518 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (503 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
Probably explored full state space saw : 3261 states, properties seen :0
Probabilistic random walk after 18802 steps, saw 3261 distinct states, run finished after 181 ms. (steps per millisecond=103 ) properties seen :0
Explored full state space saw : 3261 states, properties seen :0
Exhaustive walk after 18802 steps, saw 3261 distinct states, run finished after 154 ms. (steps per millisecond=122 ) properties seen :0
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
FORMULA EGFr-PT-02010-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 18:34:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 18:34:12] [INFO ] Flatten gal took : 22 ms
[2024-05-22 18:34:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 18:34:12] [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-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 18:34:12] [INFO ] Flatten gal took : 10 ms
FORMULA EGFr-PT-02010-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 18:34:12] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 32 out of 40 places (down from 34) after GAL structural reductions.
Computed a total of 14 stabilizing places and 7 stable transitions
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 17 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2024-05-22 18:34:12] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 33 cols
[2024-05-22 18:34:12] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 18:34:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 18:34:12] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:12] [INFO ] Invariant cache hit.
[2024-05-22 18:34:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 18:34:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-22 18:34:12] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-22 18:34:12] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:12] [INFO ] Invariant cache hit.
[2024-05-22 18:34:12] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 18:34:12] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:12] [INFO ] Deduced a trap composed of 2 places in 22 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
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 68 constraints, problems are : Problem set: 1 solved, 43 unsolved in 993 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: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
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, 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, 43/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 111 constraints, problems are : Problem set: 1 solved, 43 unsolved in 865 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: 4/4 constraints]
After SMT, in 1884ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1886ms
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 5 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 18:34:14] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 2077 ms. Remains : 33/40 places, 47/53 transitions.
[2024-05-22 18:34:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:14] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-22 18:34:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4823952742690965515.gal : 5 ms
[2024-05-22 18:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability18355995955027079960.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4823952742690965515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18355995955027079960.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(A(!(EG(EF(((AKT1_equals_1==1)&&(p27_equals_1==1))))) U ((((((AKT1_0==1)&&(ERBB1_equals_1==1))||((CDK4_equals_1==1)&&(p27_equals_1==1)))...480
=> equivalent forward existential formula: (([((FwdU(Init,!(((((((AKT1_0==1)&&(ERBB1_equals_1==1))||((CDK4_equals_1==1)&&(p27_equals_1==1)))&&(((((AKT1_0==...1895
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t21, t22, t23, t28, t29, t30, t31, t32, t34, t35,...279
(forward)formula 0,0,0.153901,6072,1,0,178,13288,121,72,1146,14119,171
FORMULA EGFr-PT-02010-CTLFireability-2024-01 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 14 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2024-05-22 18:34:14] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:14] [INFO ] Invariant cache hit.
[2024-05-22 18:34:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 18:34:14] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:14] [INFO ] Invariant cache hit.
[2024-05-22 18:34:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 18:34:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-22 18:34:14] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-22 18:34:14] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:14] [INFO ] Invariant cache hit.
[2024-05-22 18:34:14] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 18:34:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:15] [INFO ] Deduced a trap composed of 2 places in 29 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
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 68 constraints, problems are : Problem set: 1 solved, 43 unsolved in 1164 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: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
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, 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, 43/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 111 constraints, problems are : Problem set: 1 solved, 43 unsolved in 795 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: 4/4 constraints]
After SMT, in 1982ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1985ms
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 5 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 18:34:16] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 2216 ms. Remains : 33/40 places, 47/53 transitions.
[2024-05-22 18:34:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:16] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-22 18:34:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:16] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11033716363426075094.gal : 4 ms
[2024-05-22 18:34:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2955302299619434367.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11033716363426075094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2955302299619434367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG(((ERalpha_equals_1!=1)||(MYC_equals_0!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((ERalpha_equals_1!=1)||(MYC_equals_0!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t21, t22, t23, t28, t29, t30, t31, t32, t34, t35,...279
dead was empty
(forward)formula 0,1,0.097203,5396,1,0,128,10365,104,43,1081,9222,125
FORMULA EGFr-PT-02010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 13 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2024-05-22 18:34:17] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:17] [INFO ] Invariant cache hit.
[2024-05-22 18:34:17] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 18:34:17] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:17] [INFO ] Invariant cache hit.
[2024-05-22 18:34:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 18:34:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-22 18:34:17] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-22 18:34:17] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:17] [INFO ] Invariant cache hit.
[2024-05-22 18:34:17] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 18:34:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:17] [INFO ] Deduced a trap composed of 2 places in 26 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
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 68 constraints, problems are : Problem set: 1 solved, 43 unsolved in 1102 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: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
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, 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, 43/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 111 constraints, problems are : Problem set: 1 solved, 43 unsolved in 781 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: 4/4 constraints]
After SMT, in 1911ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1913ms
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.
[2024-05-22 18:34:19] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 2161 ms. Remains : 33/40 places, 47/53 transitions.
[2024-05-22 18:34:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:19] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-22 18:34:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:19] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5082174883982764820.gal : 2 ms
[2024-05-22 18:34:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2673194988494740026.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5082174883982764820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2673194988494740026.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2639,0.020716,3756,2,143,5,1210,6,0,169,867,0


Converting to forward existential form...Done !
original formula: EG(EF(((AKT1_0==0)||(ERBB2_3_equals_1==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((AKT1_0==0)||(ERBB2_3_equals_1==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t21, t22, t23, t28, t29, t30, t31, t32, t34, t35,...279
(forward)formula 0,1,0.097878,5392,1,0,122,10357,104,41,1127,9594,117
FORMULA EGFr-PT-02010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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.
[2024-05-22 18:34:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:19] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 18:34:19] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 18:34:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:19] [INFO ] Invariant cache hit.
[2024-05-22 18:34:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:19] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:19] [INFO ] Invariant cache hit.
[2024-05-22 18:34:19] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:34:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:34:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:19] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 24 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
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-05-22 18:34:20] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 2123 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: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
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, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1110 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: 12/12 constraints]
After SMT, in 3258ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3261ms
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 3467 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:22] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6293957642170628802.gal : 2 ms
[2024-05-22 18:34:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5705146183921735422.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6293957642170628802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5705146183921735422.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4200,0.023832,3796,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: EF(AG(AX((((A(((AKT1_0==1)&&(ERBB2_3_equals_1==1)) U (((AKT1_equals_1==1)&&(ERBB2_3_equals_0==1))&&(IGF1R_equals_0==1))) * (AKT1_equals_1...235
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((((!((E(!((((AKT1_equals_1==1)&&(ERBB2_3_equals_0==1))&&(IGF1R_equals_0=...466
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
(forward)formula 0,1,0.243597,8600,1,0,259,30617,120,112,1221,34896,254
FORMULA EGFr-PT-02010-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:34:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:23] [INFO ] Invariant cache hit.
[2024-05-22 18:34:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 18:34:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:23] [INFO ] Invariant cache hit.
[2024-05-22 18:34:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:23] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:23] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:23] [INFO ] Invariant cache hit.
[2024-05-22 18:34:23] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 24 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
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:34:23] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:34:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:24] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 2004 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: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
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, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1152 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: 12/12 constraints]
After SMT, in 3173ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3175ms
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 2 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 3413 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:26] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8543355471864241415.gal : 2 ms
[2024-05-22 18:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2508293127382449439.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8543355471864241415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2508293127382449439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4200,0.026124,3796,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.027797,3796,1,0,6,1359,7,1,328,1038,1
FORMULA EGFr-PT-02010-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:26] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:26] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:34:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 18:34:26] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:26] [INFO ] Invariant cache hit.
[2024-05-22 18:34:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-22 18:34:26] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:26] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:26] [INFO ] Invariant cache hit.
[2024-05-22 18:34:26] [INFO ] State equation strengthened by 19 read => feed constraints.
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
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 28 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
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 4 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:27] [INFO ] Deduced a trap composed of 2 places in 29 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 2183 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]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
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 1303 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]
After SMT, in 3503ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3504ms
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 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-22 18:34:30] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 3741 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:30] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12143984828794955825.gal : 6 ms
[2024-05-22 18:34:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9352742665078982425.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12143984828794955825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9352742665078982425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(!(((AKT1_0==1)&&(ERBB1_3_equals_1==1))) U (EG(AF((((((ERBB1_equals_1==1)&&(ERBB1_3_equals_0==1))&&(ERBB3_equals_1==1))||((MEK1_equals_1...277
=> equivalent forward existential formula: [((FwdU(Init,!(((AKT1_0==1)&&(ERBB1_3_equals_1==1)))) * EG(!(EG(!((((((ERBB1_equals_1==1)&&(ERBB1_3_equals_0==1)...335
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.28931,9936,1,0,291,39827,125,134,1244,44933,319
FORMULA EGFr-PT-02010-CTLFireability-2024-07 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 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:34:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:30] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 18:34:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 18:34:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:30] [INFO ] Invariant cache hit.
[2024-05-22 18:34:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:30] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:30] [INFO ] Invariant cache hit.
[2024-05-22 18:34:30] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 21 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
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1914 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: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
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, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1105 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: 12/12 constraints]
After SMT, in 3039ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3041ms
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 3272 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:33] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13135234187666473087.gal : 2 ms
[2024-05-22 18:34:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15049610715460345140.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13135234187666473087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15049610715460345140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4200,0.024144,3788,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: AF((AG((AX(((EGF_equals_1==1)&&(ERBB3_equals_0==1))) * ((AKT1_0!=1)||(ERBB1_equals_1!=1)))) + AF(EG(((((ERBB1_equals_1==1)&&(MEK1_equals_...233
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((!(EX(!(((EGF_equals_1==1)&&(ERBB3_equals_0==1))))) * ((AKT1_0!=1)||(ERBB1_equals_1!=...302
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,1,0.178714,7272,1,0,187,23382,115,82,1218,23502,210
FORMULA EGFr-PT-02010-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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.
[2024-05-22 18:34:34] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 33 cols
[2024-05-22 18:34:34] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 18:34:34] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 18:34:34] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:34] [INFO ] Invariant cache hit.
[2024-05-22 18:34:34] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 18:34:34] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-22 18:34:34] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-22 18:34:34] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2024-05-22 18:34:34] [INFO ] Invariant cache hit.
[2024-05-22 18:34:34] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 24 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
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 68 constraints, problems are : Problem set: 1 solved, 43 unsolved in 1140 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: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
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, 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, 43/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 111 constraints, problems are : Problem set: 1 solved, 43 unsolved in 855 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: 4/4 constraints]
After SMT, in 2012ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 2014ms
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 4 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 18:34:36] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 2232 ms. Remains : 33/40 places, 47/53 transitions.
[2024-05-22 18:34:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 18:34:36] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-22 18:34:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:36] [INFO ] Time to serialize gal into /tmp/CTLFireability225670443527253236.gal : 2 ms
[2024-05-22 18:34:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11925390229471499014.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability225670443527253236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11925390229471499014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2639,0.021718,3756,2,143,5,1210,6,0,169,867,0


Converting to forward existential form...Done !
original formula: E(!(A((((AKT1_0==1)&&(ERBB2_3_equals_0==1))&&((ERalpha_equals_1==1)&&(IGF1R_equals_0==1))) U AG(!((((((AKT1_0==1)&&(ERBB2_3_equals_0==1))...414
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!(!((E(!(!(E(TRUE U !(!((((((AKT1_0==1)&&(ERBB2_3_equals_0==1))&&((ERalpha_equals_1==1)&&(I...914
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t21, t22, t23, t28, t29, t30, t31, t32, t34, t35,...279
dead was empty
(forward)formula 0,0,0.115374,5652,1,0,148,11135,114,63,1152,10520,156
FORMULA EGFr-PT-02010-CTLFireability-2024-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.
[2024-05-22 18:34:36] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
// Phase 1: matrix 32 rows 38 cols
[2024-05-22 18:34:36] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 18:34:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 18:34:36] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:34:36] [INFO ] Invariant cache hit.
[2024-05-22 18:34:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 18:34:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-22 18:34:36] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-22 18:34:36] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:34:36] [INFO ] Invariant cache hit.
[2024-05-22 18:34:36] [INFO ] State equation strengthened by 16 read => feed constraints.
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
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 26 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
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 117 constraints, problems are : Problem set: 1 solved, 46 unsolved in 1756 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: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 46 unsolved
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, 6/59 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 32/70 variables, 38/101 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 16/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 46/163 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 163 constraints, problems are : Problem set: 1 solved, 46 unsolved in 1165 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: 6/6 constraints]
After SMT, in 2937ms problems are : Problem set: 1 solved, 46 unsolved
Search for dead transitions found 1 dead transitions in 2939ms
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 4 ms. Remains 38 /38 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-22 18:34:39] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 3157 ms. Remains : 38/40 places, 51/53 transitions.
[2024-05-22 18:34:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 18:34:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:39] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-22 18:34:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9797279964991019741.gal : 2 ms
[2024-05-22 18:34:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16966209802839324390.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9797279964991019741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16966209802839324390.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4196,0.024882,3792,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.287403,9916,1,0,307,36496,122,151,1214,43946,362
FORMULA EGFr-PT-02010-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 18:34:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 18:34:40] [INFO ] Flatten gal took : 5 ms
Total runtime 38169 ms.

BK_STOP 1716402880206

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-5568"
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 r158-smll-171636265900002"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;