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-171636265900001.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636265900001
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-01
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-02
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-03
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-04
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-05
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-06
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-07
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-08
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-09
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-10
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-11
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-12
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-13
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-14
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716402839194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-22 18:34:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 18:34:02] [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): 132 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 381 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
FORMULA EGFr-PT-02010-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 36 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-22 18:34:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-22 18:34:03] [INFO ] Computed 20 invariants in 8 ms
[2024-05-22 18:34:03] [INFO ] Implicit Places using invariants in 302 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 540 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:04] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 18 ms to minimize.
[2024-05-22 18:34:04] [INFO ] Deduced a trap composed of 2 places in 28 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 28 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 29 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 22 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 26 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 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 2267 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 1530 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 3926ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 3970ms
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 3 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 4654 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 ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 18:34:07] [INFO ] Flatten gal took : 54 ms
[2024-05-22 18:34:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 18:34:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 18:34:07] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 39 out of 40 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 54 to 51
RANDOM walk for 40000 steps (1790 resets) in 2272 ms. (17 steps per ms) remains 4/51 properties
BEST_FIRST walk for 40003 steps (421 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (435 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (388 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (421 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
[2024-05-22 18:34:09] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:09] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 18:34:09] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/18 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 4 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 26 ms of which 2 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/34 variables, 18/47 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 10 (OVERLAPS) 11/45 variables, 15/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 28/73 variables, 22/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 22/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 11/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/73 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 121 constraints, problems are : Problem set: 2 solved, 2 unsolved in 244 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: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/14 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/27 variables, 14/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/40 variables, 13/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 4/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 33/73 variables, 26/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 26/108 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 13/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 2/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 18:34:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/73 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/73 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 124 constraints, problems are : Problem set: 2 solved, 2 unsolved in 221 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: 2/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 483ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Graph (complete) has 116 edges and 40 vertex of which 36 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 35 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 35 transition count 46
Applied a total of 7 rules in 37 ms. Remains 35 /40 variables (removed 5) and now considering 46/53 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 35/40 places, 46/53 transitions.
RANDOM walk for 40000 steps (1976 resets) in 662 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (437 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (420 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2985 states, properties seen :0
Probabilistic random walk after 17107 steps, saw 2985 distinct states, run finished after 150 ms. (steps per millisecond=114 ) properties seen :0
Explored full state space saw : 2985 states, properties seen :0
Exhaustive walk after 17107 steps, saw 2985 distinct states, run finished after 83 ms. (steps per millisecond=206 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 18:34:10] [INFO ] Flatten gal took : 12 ms
[2024-05-22 18:34:10] [INFO ] Flatten gal took : 13 ms
[2024-05-22 18:34:10] [INFO ] Input system was already deterministic with 53 transitions.
Computed a total of 14 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
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:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:10] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 18:34:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 18:34:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:10] [INFO ] Invariant cache hit.
[2024-05-22 18:34:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:10] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:10] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:10] [INFO ] Invariant cache hit.
[2024-05-22 18:34:10] [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:10] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-22 18:34:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 2 places in 22 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:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:11] [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:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:11] [INFO ] Deduced a trap composed of 2 places in 20 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 1754 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 907 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 2692ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2696ms
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 2916 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:13] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:13] [INFO ] Flatten gal took : 19 ms
[2024-05-22 18:34:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17041149491395647600.gal : 4 ms
[2024-05-22 18:34:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15975975602793156863.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/CTLCardinality17041149491395647600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15975975602793156863.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.053543,3680,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: EG(E(((EX(((ERBB2_equals_0==1)&&((CyclinD1_equals_1==0)||(CyclinE1_equals_0==1)))) * (IGF1R_equals_1==0)) * ((CyclinD1_equals_0==1) + EG(...201
=> equivalent forward existential formula: [FwdG(Init,E(((EX(((ERBB2_equals_0==1)&&((CyclinD1_equals_1==0)||(CyclinE1_equals_0==1)))) * (IGF1R_equals_1==0)...244
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t12, t16, t18, t19, t22, t23, t24, t25, t26, t31, t32, t33, t34,...294
dead was empty
(forward)formula 0,0,0.18216,8252,1,0,259,27310,114,108,1197,29671,248
FORMULA EGFr-PT-02010-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:13] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:13] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:34:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 18:34:13] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:13] [INFO ] Invariant cache hit.
[2024-05-22 18:34:13] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:13] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:13] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:13] [INFO ] Invariant cache hit.
[2024-05-22 18:34:13] [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:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 31 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:14] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:14] [INFO ] Deduced a trap composed of 2 places in 30 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 2152 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 1322 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 3494ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3497ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3776 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:17] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality4758473785961325968.gal : 4 ms
[2024-05-22 18:34:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12692855910626486128.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/CTLCardinality4758473785961325968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12692855910626486128.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.024885,3820,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: AF((EX(((ERBB2_3_equals_0==0)&&(ERalpha_equals_0==0))) + AG(((((p21_equals_0==0)&&(ERBB1_2_equals_1==0))||(CyclinE1_equals_0==0))&&(ERBB3...172
=> equivalent forward existential formula: [FwdG(Init,!((EX(((ERBB2_3_equals_0==0)&&(ERalpha_equals_0==0))) + !(E(TRUE U !(((((p21_equals_0==0)&&(ERBB1_2_e...229
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,1,0.23326,8096,1,0,191,27047,118,83,1244,26843,171
FORMULA EGFr-PT-02010-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:17] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:17] [INFO ] Invariant cache hit.
[2024-05-22 18:34:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 18:34:17] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:17] [INFO ] Invariant cache hit.
[2024-05-22 18:34:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:18] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:18] [INFO ] Invariant cache hit.
[2024-05-22 18:34:18] [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:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [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:18] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 2 places in 31 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:18] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:18] [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 2109 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 1284 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 3415ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3418ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3662 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:21] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8521119981083993148.gal : 3 ms
[2024-05-22 18:34:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7355230979937459664.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/CTLCardinality8521119981083993148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7355230979937459664.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.027109,3812,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: AX(EF(((EF(EG((CDK6_equals_1==1))) * EG((IGF1R_equals_1==0))) * (EG(((pRB1_equals_1==0)&&(ERBB1_2_equals_1==1))) * ((AF((p21_equals_1==0)...304
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((E(TRUE U EG((CDK6_equals_1==1))) * EG((IGF1R_equals_1==0))) * (EG(((pRB1_equals_1==0)&...375
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.209111,8088,1,0,192,26212,124,81,1239,25460,217
FORMULA EGFr-PT-02010-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:21] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:21] [INFO ] Invariant cache hit.
[2024-05-22 18:34:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 18:34:21] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:21] [INFO ] Invariant cache hit.
[2024-05-22 18:34:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:21] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:21] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:21] [INFO ] Invariant cache hit.
[2024-05-22 18:34:21] [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:22] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 29 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:22] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:22] [INFO ] Deduced a trap composed of 2 places in 28 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 2131 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 1272 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 3424ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3426ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3610 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:25] [INFO ] Flatten gal took : 12 ms
[2024-05-22 18:34:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:25] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16399299385497197217.gal : 2 ms
[2024-05-22 18:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality8604303485374964148.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/CTLCardinality16399299385497197217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8604303485374964148.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.024516,3816,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: AF((((EF((((ERBB1_equals_0!=0)&&(CyclinD1_equals_0!=1))||(IGF1R_equals_1==1))) * EF((ERBB1_3_equals_1==0))) * ((ERBB1_3_equals_0==1)&&(CD...607
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (((ERBB1_equals_0!=0)&&(CyclinD1_equals_0!=1))||(IGF1R_equals_1==1))) * E(TRUE U (ERBB1...749
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.478644,14164,1,0,480,61241,151,256,1265,78108,497
FORMULA EGFr-PT-02010-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:25] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:25] [INFO ] Invariant cache hit.
[2024-05-22 18:34:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 18:34:25] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:25] [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 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
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:26] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 31 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:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:26] [INFO ] Deduced a trap composed of 2 places in 28 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 2120 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 1306 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 3446ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3448ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3666 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:29] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:29] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7322358957305161197.gal : 2 ms
[2024-05-22 18:34:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9773276632140931354.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/CTLCardinality7322358957305161197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9773276632140931354.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.02553,3808,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: A(EF(((CDK2_equals_1==1)||(!(((ERalpha_equals_1==0)||(pRB1_equals_1==1))&&((CyclinD1_equals_1==0)||(ERBB2_equals_0==1)))))) U !(EX(((E(((...500
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(((E(((CDK2_equals_1==1)&&((ERBB1_3_equals_0==0)||(AKT1_equals_1==1))) U (MEK1_equals_1==1)...1293
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,1,0.187668,7556,1,0,164,23729,124,60,1265,22824,163
FORMULA EGFr-PT-02010-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 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:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:29] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 18:34:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-22 18:34:29] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:29] [INFO ] Invariant cache hit.
[2024-05-22 18:34:29] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:30] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 235 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:30] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:34:30] [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:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 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:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 30 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:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:30] [INFO ] Deduced a trap composed of 2 places in 22 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 1969 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 1115 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 3101ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3102ms
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 3343 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 : 6 ms
[2024-05-22 18:34:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3624272584366833072.gal : 2 ms
[2024-05-22 18:34:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2375894036240964653.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/CTLCardinality3624272584366833072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2375894036240964653.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.024347,3796,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(AX((ERBB2_3_equals_1==1)))) * ((EX(EF(((CDK2_equals_0==0)||(p27_equals_1==1)))) + AF(EG(((MEK1_equals_1==0)||(ERBB1_equals_1==1...187
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(!(EX(!((ERBB2_3_equals_1==1)))))))) * ((EX(E(TRUE U ((CDK2_equals_0==0)||(p27_equals_1==...256
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.239939,8864,1,0,278,31428,119,125,1209,36434,275
FORMULA EGFr-PT-02010-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:33] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:33] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:34:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 18:34:33] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:33] [INFO ] Invariant cache hit.
[2024-05-22 18:34:33] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:33] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:33] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:33] [INFO ] Invariant cache hit.
[2024-05-22 18:34:33] [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:33] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-22 18:34:33] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [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:34] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 5 places in 24 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.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 5 places in 26 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.
[2024-05-22 18:34:34] [INFO ] Deduced a trap composed of 2 places in 28 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 2157 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 1247 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 3426ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3428ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3685 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:37] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8003494663386707541.gal : 1 ms
[2024-05-22 18:34:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15095302660746423208.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/CTLCardinality8003494663386707541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15095302660746423208.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.026009,3816,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: !(A(((ERBB1_3_equals_0==1) + E(AF(((CDK6_equals_0==0)||(ERBB1_3_equals_1==1))) U (p21_equals_1==1))) U AF(AX(((IGF1R_equals_1==1)&&(ERBB3...173
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(!(EX(!(((IGF1R_equals_1==1)&&(ERBB3_equals_0==1)))))))))) * !(((ERBB1_3_equals_0==1) ...394
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
dead was empty
dead was empty
(forward)formula 0,0,0.152739,7036,1,0,150,19699,128,49,1241,16978,135
FORMULA EGFr-PT-02010-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:34:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:37] [INFO ] Computed 19 invariants in 9 ms
[2024-05-22 18:34:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 18:34:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:37] [INFO ] Invariant cache hit.
[2024-05-22 18:34:37] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:37] [INFO ] Invariant cache hit.
[2024-05-22 18:34:37] [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:37] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:37] [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:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:37] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:34:38] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:38] [INFO ] Deduced a trap composed of 2 places in 22 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:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:34:38] [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:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:34:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 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 2027 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 1168 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 3212ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3215ms
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 3487 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:40] [INFO ] Flatten gal took : 6 ms
[2024-05-22 18:34:40] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:40] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:40] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:40] [INFO ] Flatten gal took : 4 ms
[2024-05-22 18:34:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5496940412159841022.gal : 2 ms
[2024-05-22 18:34:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9933217794053240624.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/CTLCardinality5496940412159841022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9933217794053240624.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.026837,3784,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: EG((AX(FALSE) + ((ERBB1_2_equals_0==1) * ((ERBB1_equals_1==1) + AF((ERBB1_equals_1==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(FALSE))) + ((ERBB1_2_equals_0==1) * ((ERBB1_equals_1==1) + !(EG(!((ERBB1_equals_1==0))))))))]...164
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.252888,8852,1,0,288,31987,113,138,1192,36832,266
FORMULA EGFr-PT-02010-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:34:41] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:34:41] [INFO ] Computed 20 invariants in 2 ms
[2024-05-22 18:34:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 18:34:41] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:41] [INFO ] Invariant cache hit.
[2024-05-22 18:34:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:34:41] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:34:41] [INFO ] Invariant cache hit.
[2024-05-22 18:34:41] [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:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 2 places in 26 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:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:34:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:34:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:34:42] [INFO ] Deduced a trap composed of 2 places in 27 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 1888 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 814 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 2738ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 2740ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2940 ms. Remains : 40/40 places, 52/53 transitions.
[2024-05-22 18:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 18:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 18:34:44] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 18:34:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 18:34:44] [INFO ] Flatten gal took : 7 ms
[2024-05-22 18:34:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality3079511576075833294.gal : 1 ms
[2024-05-22 18:34:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15669157404942715529.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/CTLCardinality3079511576075833294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15669157404942715529.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.015467,3812,2,190,5,1452,6,0,191,1106,0


Converting to forward existential form...Done !
original formula: A((((ERBB2_3_equals_1==0)||(MEK1_equals_0==1)) + ((ERalpha_equals_1==0) * ((!(EF(((ERBB3_equals_0==0)||(ERBB2_equals_0==1)))) + !(((ERBB2...419
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!((!(E(TRUE U !(((CyclinE1_equals_0==0)||(ERBB1_3_equals_1==1))))) + !(EG(!(((ERBB2_equ...936
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.163452,9408,1,0,241,34824,129,115,1262,37237,296
FORMULA EGFr-PT-02010-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:34:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:34:44] [INFO ] Computed 19 invariants in 0 ms
[2024-05-22 18:34:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 18:34:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:44] [INFO ] Invariant cache hit.
[2024-05-22 18:34:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:34:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:34:44] [INFO ] Invariant cache hit.
[2024-05-22 18:34:44] [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:44] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 22 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:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 17 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:44] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:34:44] [INFO ] Deduced a trap composed of 2 places in 15 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 1340 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 1015 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 2366ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2367ms
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 2509 ms. Remains : 39/40 places, 50/53 transitions.
[2024-05-22 18:34:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 18:34:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 18:34:46] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-22 18:34:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality20270777799174745.gal : 1 ms
[2024-05-22 18:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4228575433372831134.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/CTLCardinality20270777799174745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4228575433372831134.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 -...281
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.024339,3788,2,178,5,1359,6,0,187,1038,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(((p27_equals_1==0)||(p27_equals_0==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(((p27_equals_1==0)||(p27_equals_0==1)))))))] = FALSE
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.129087,6216,1,0,136,16466,110,41,1202,13408,122
FORMULA EGFr-PT-02010-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 18:34:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 18:34:46] [INFO ] Flatten gal took : 5 ms
Total runtime 44640 ms.

BK_STOP 1716402887000

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EGFr-PT-02010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EGFr-PT-02010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636265900001"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;