About the Execution of ITS-Tools for EGFr-PT-02010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.170 | 6527.00 | 13835.00 | 93.40 | FTTFTTFFFFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200738.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200738
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.0K May 13 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 13 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 13 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 59K May 12 20:53 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-00
FORMULA_NAME EGFr-PT-02010-01
FORMULA_NAME EGFr-PT-02010-02
FORMULA_NAME EGFr-PT-02010-03
FORMULA_NAME EGFr-PT-02010-04
FORMULA_NAME EGFr-PT-02010-05
FORMULA_NAME EGFr-PT-02010-06
FORMULA_NAME EGFr-PT-02010-07
FORMULA_NAME EGFr-PT-02010-08
FORMULA_NAME EGFr-PT-02010-09
FORMULA_NAME EGFr-PT-02010-10
FORMULA_NAME EGFr-PT-02010-11
FORMULA_NAME EGFr-PT-02010-12
FORMULA_NAME EGFr-PT-02010-13
FORMULA_NAME EGFr-PT-02010-14
FORMULA_NAME EGFr-PT-02010-15
=== Now, execution of the tool begins
BK_START 1590556254625
[2020-05-27 05:10:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 05:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:56] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-05-27 05:10:56] [INFO ] Transformed 40 places.
[2020-05-27 05:10:56] [INFO ] Transformed 68 transitions.
[2020-05-27 05:10:56] [INFO ] Found NUPN structural information;
[2020-05-27 05:10:56] [INFO ] Parsed PT model containing 40 places and 68 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4478 resets, run finished after 252 ms. (steps per millisecond=396 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
[2020-05-27 05:10:57] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2020-05-27 05:10:57] [INFO ] Computed 20 place invariants in 6 ms
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-27 05:10:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-27 05:10:57] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2020-05-27 05:10:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-27 05:10:57] [INFO ] Deduced a trap composed of 2 places in 32 ms
[2020-05-27 05:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-05-27 05:10:57] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 6 ms.
[2020-05-27 05:10:57] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2020-05-27 05:10:57] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 8 ms.
[2020-05-27 05:10:57] [INFO ] Added : 27 causal constraints over 6 iterations in 51 ms. Result :sat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-05-27 05:10:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 9 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-05-27 05:10:58] [INFO ] Added : 15 causal constraints over 3 iterations in 17 ms. Result :unsat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 8 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-05-27 05:10:58] [INFO ] Added : 27 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 6 ms.
[2020-05-27 05:10:58] [INFO ] Added : 26 causal constraints over 6 iterations in 33 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 7 ms.
[2020-05-27 05:10:58] [INFO ] Added : 27 causal constraints over 6 iterations in 42 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 10 ms
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 5 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 22 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-05-27 05:10:58] [INFO ] Added : 28 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-05-27 05:10:58] [INFO ] Added : 27 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 11 ms
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 25 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 9 ms.
[2020-05-27 05:10:59] [INFO ] Added : 29 causal constraints over 6 iterations in 55 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-05-27 05:10:59] [INFO ] Added : 27 causal constraints over 6 iterations in 41 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-05-27 05:10:59] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Deduced a trap composed of 2 places in 8 ms
[2020-05-27 05:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 11 ms.
[2020-05-27 05:10:59] [INFO ] Added : 27 causal constraints over 6 iterations in 37 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 05:10:59] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 05:10:59] [INFO ] Flatten gal took : 57 ms
FORMULA EGFr-PT-02010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:59] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:59] [INFO ] Applying decomposition
[2020-05-27 05:10:59] [INFO ] Flatten gal took : 9 ms
[2020-05-27 05:10:59] [INFO ] Input system was already deterministic with 68 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 39 out of 68 initially.
// Phase 1: matrix 39 rows 40 cols
[2020-05-27 05:10:59] [INFO ] Computed 20 place invariants in 2 ms
inv : MEK1_equals_0 + MEK1_equals_1 = 1
inv : ERBB2_equals_0 + ERBB2_equals_1 = 1
inv : AKT1_0 + AKT1_equals_1 = 1
inv : CyclinD1_equals_0 + CyclinD1_equals_1 = 1
inv : IGF1R_equals_0 + IGF1R_equals_1 = 1
inv : MYC_equals_0 + MYC_equals_1 = 1
inv : pRB1_equals_0 + pRB1_equals_1 = 1
inv : CDK6_equals_0 + CDK6_equals_1 = 1
inv : ERBB2_3_equals_0 + ERBB2_3_equals_1 = 1
inv : CDK4_equals_0 + CDK4_equals_1 = 1
inv : ERBB1_equals_0 + ERBB1_equals_1 = 1
inv : ERBB1_2_equals_0 + ERBB1_2_equals_1 = 1
inv : ERBB3_equals_0 + ERBB3_equals_1 = 1
inv : p27_equals_0 + p27_equals_1 = 1
inv : EGF_equals_0 + EGF_equals_1 = 1
inv : ERalpha_equals_0 + ERalpha_equals_1 = 1
inv : p21_equals_0 + p21_equals_1 = 1
inv : CDK2_equals_0 + CDK2_equals_1 = 1
inv : ERBB1_3_equals_0 + ERBB1_3_equals_1 = 1
inv : CyclinE1_equals_0 + CyclinE1_equals_1 = 1
Total of 20 invariants.
[2020-05-27 05:10:59] [INFO ] Computed 20 place invariants in 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6543978634781646573.txt, -o, /tmp/graph6543978634781646573.bin, -w, /tmp/graph6543978634781646573.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6543978634781646573.bin, -l, -1, -v, -w, /tmp/graph6543978634781646573.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:59] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:59] [INFO ] Proved 40 variables to be positive in 95 ms
[2020-05-27 05:10:59] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2020-05-27 05:10:59] [INFO ] Computation of disable matrix completed :0/68 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:59] [INFO ] Removed a total of 92 redundant transitions.
[2020-05-27 05:10:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:59] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2020-05-27 05:10:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:00] [INFO ] Flatten gal took : 66 ms
[2020-05-27 05:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2020-05-27 05:11:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-27 05:11:00] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((X(G(F(!(X(("((i4.u6.EGF_equals_1==1)&&(i4.u12.ERBB3_equals_0==1))")U("((i4.u10.ERBB2_equals_0==1)&&(i4.u11.ERBB2_3_equals_1==1))"))))))))
Formula 0 simplified : !XGF!X("((i4.u6.EGF_equals_1==1)&&(i4.u12.ERBB3_equals_0==1))" U "((i4.u10.ERBB2_equals_0==1)&&(i4.u11.ERBB2_3_equals_1==1))")
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 21 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1, CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_0_and_ERalpha_equals_1_and_MEK1_equals_1_and_MYC_equals_1, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1, ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1, ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1, IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1, MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1, MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1, MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1, p21_equals_1_to_p21_equals_0_when_AKT1_equals_1, p21_equals_1_to_p21_equals_0_when_MYC_equals_1, i0.ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1, i0.AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1, i1.CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1, i2.CyclinE1_equals_0_to_CyclinE1_equals_1_when_MYC_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_3_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1, i4.ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1, i4.ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1, i4.ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1, i4.u6.EGF_equals_0_to_EGF_equals_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/8/27/65
Computing Next relation with stutter on 1 deadlock states
47 unique states visited
0 strongly connected components in search stack
48 transitions explored
25 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.171843,21748,1,0,9356,34,976,14390,45,32,28302
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(((((X("((i4.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1))"))&&("(i0.u13.ERalpha_equals_1==1)"))&&("(i2.u16.MYC_equals_0==1)"))&&("(i4.u6.EGF_equals_1==1)"))&&("(i3.u7.ERBB1_equals_0==1)")))))
Formula 1 simplified : !GF("(i0.u13.ERalpha_equals_1==1)" & "(i2.u16.MYC_equals_0==1)" & "(i3.u7.ERBB1_equals_0==1)" & "(i4.u6.EGF_equals_1==1)" & X"((i4.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1))")
Computing Next relation with stutter on 1 deadlock states
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.190435,23808,1,0,10177,34,1030,15147,47,32,32150
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA EGFr-PT-02010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F((((X(G(X("(((i3.u15.MEK1_equals_1==1)&&(i2.u16.MYC_equals_0==1))||((i3.u7.ERBB1_equals_0==1)&&(i3.u8.ERBB1_2_equals_1==1)))"))))||("(i4.u11.ERBB2_3_equals_1!=1)"))||("(i3.u15.MEK1_equals_0!=1)"))||("((i3.u7.ERBB1_equals_0==1)&&(i3.u8.ERBB1_2_equals_1==1))"))))))
Formula 2 simplified : !XGF("((i3.u7.ERBB1_equals_0==1)&&(i3.u8.ERBB1_2_equals_1==1))" | "(i3.u15.MEK1_equals_0!=1)" | "(i4.u11.ERBB2_3_equals_1!=1)" | XGX"(((i3.u15.MEK1_equals_1==1)&&(i2.u16.MYC_equals_0==1))||((i3.u7.ERBB1_equals_0==1)&&(i3.u8.ERBB1_2_equals_1==1)))")
Computing Next relation with stutter on 1 deadlock states
172 unique states visited
0 strongly connected components in search stack
339 transitions explored
24 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.29397,26132,1,0,15200,34,1096,21701,47,32,48754
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(X((X(G(X(G(X((!(X("((i3.u7.ERBB1_equals_0==1)&&(i3.u9.ERBB1_3_equals_1==1))")))&&("((i1.u3.CDK6_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))")))))))U("((i0.u0.AKT1_equals_1==1)&&(i5.i1.u18.p27_equals_1==1))"))))))
Formula 3 simplified : !F!X(XGXGX("((i1.u3.CDK6_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))" & !X"((i3.u7.ERBB1_equals_0==1)&&(i3.u9.ERBB1_3_equals_1==1))") U "((i0.u0.AKT1_equals_1==1)&&(i5.i1.u18.p27_equals_1==1))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.376338,29440,1,0,22458,34,1164,30192,47,32,65780
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(("(((i0.u0.AKT1_equals_1==1)&&(i5.i1.u18.p27_equals_1==1))||((i0.u0.AKT1_equals_1==1)&&(i2.u16.MYC_equals_0==1)))")U(F(G(F("((((i0.u0.AKT1_equals_1!=1)||(i5.i1.u18.p27_equals_1!=1))||(i4.u11.ERBB2_3_equals_1!=1))||(i4.u12.ERBB3_equals_0!=1))"))))))))
Formula 4 simplified : X("(((i0.u0.AKT1_equals_1==1)&&(i5.i1.u18.p27_equals_1==1))||((i0.u0.AKT1_equals_1==1)&&(i2.u16.MYC_equals_0==1)))" U FGF"((((i0.u0.AKT1_equals_1!=1)||(i5.i1.u18.p27_equals_1!=1))||(i4.u11.ERBB2_3_equals_1!=1))||(i4.u12.ERBB3_equals_0!=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.412754,31012,1,0,26008,34,1194,33889,47,32,73680
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA EGFr-PT-02010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((i0.u0.AKT1_0!=1)||(i0.u14.IGF1R_equals_1!=1))")))
Formula 5 simplified : !G"((i0.u0.AKT1_0!=1)||(i0.u14.IGF1R_equals_1!=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.454091,32596,1,0,29178,34,1232,37337,47,32,84082
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA EGFr-PT-02010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F((G(F(!(F(!(X("((i0.u14.IGF1R_equals_1==1)&&(i3.u15.MEK1_equals_0==1))")))))))U((F("(((i3.u7.ERBB1_equals_1==1)&&(i3.u8.ERBB1_2_equals_0==1))&&(i4.u10.ERBB2_equals_1==1))"))||("((i0.u13.ERalpha_equals_0==1)&&(i3.u15.MEK1_equals_1==1))"))))))
Formula 6 simplified : F(GF!F!X"((i0.u14.IGF1R_equals_1==1)&&(i3.u15.MEK1_equals_0==1))" U ("((i0.u13.ERalpha_equals_0==1)&&(i3.u15.MEK1_equals_1==1))" | F"(((i3.u7.ERBB1_equals_1==1)&&(i3.u8.ERBB1_2_equals_0==1))&&(i4.u10.ERBB2_equals_1==1))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.487303,34132,1,0,31875,34,1270,40657,47,32,92406
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA EGFr-PT-02010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(!(("((((i5.i0.u2.CDK4_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))||(i5.i0.u17.p21_equals_0!=1))||(i5.i1.u18.p27_equals_0!=1))")U("((((((((i0.u0.AKT1_0==1)&&(i5.i0.u2.CDK4_equals_0==1))&&(i2.u16.MYC_equals_0==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i0.u2.CDK4_equals_0==1))&&(i1.u4.CyclinD1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))"))))U(X(F("(((i0.u0.AKT1_0==1)&&(i1.u4.CyclinD1_equals_1==1))&&(i3.u15.MEK1_equals_0==1))")))))
Formula 7 simplified : !(F!("((((i5.i0.u2.CDK4_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))||(i5.i0.u17.p21_equals_0!=1))||(i5.i1.u18.p27_equals_0!=1))" U "((((((((i0.u0.AKT1_0==1)&&(i5.i0.u2.CDK4_equals_0==1))&&(i2.u16.MYC_equals_0==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i0.u2.CDK4_equals_0==1))&&(i1.u4.CyclinD1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))") U XF"(((i0.u0.AKT1_0==1)&&(i1.u4.CyclinD1_equals_1==1))&&(i3.u15.MEK1_equals_0==1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.509313,34912,1,0,33570,34,1292,42351,47,32,97016
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA EGFr-PT-02010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("(((i4.u10.ERBB2_equals_1==1)&&(i4.u11.ERBB2_3_equals_0==1))&&(i4.u12.ERBB3_equals_1==1))"))||(F("((i4.u11.ERBB2_3_equals_1==1)&&(i0.u14.IGF1R_equals_1==1))"))))
Formula 8 simplified : !(F"(((i4.u10.ERBB2_equals_1==1)&&(i4.u11.ERBB2_3_equals_0==1))&&(i4.u12.ERBB3_equals_1==1))" | F"((i4.u11.ERBB2_3_equals_1==1)&&(i0.u14.IGF1R_equals_1==1))")
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.542083,35704,1,0,35114,34,1330,43839,47,32,101547
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F("((((i5.i1.u1.CDK2_equals_0==1)&&(i2.u5.CyclinE1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))"))))
Formula 9 simplified : F"((((i5.i1.u1.CDK2_equals_0==1)&&(i2.u5.CyclinE1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.568009,36232,1,0,36022,34,1376,45228,47,32,104713
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA EGFr-PT-02010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G((X("((((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1))&&(i5.i0.u2.CDK4_equals_1==1))&&(i1.u4.CyclinD1_equals_0==1))"))||(F("((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1))"))))))
Formula 10 simplified : G(X"((((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1))&&(i5.i0.u2.CDK4_equals_1==1))&&(i1.u4.CyclinD1_equals_0==1))" | F"((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1))")
Computing Next relation with stutter on 1 deadlock states
126 unique states visited
0 strongly connected components in search stack
167 transitions explored
23 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.775802,41244,1,0,45418,34,1454,58751,47,32,139409
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((X((G("((i1.u4.CyclinD1_equals_1==1)&&(i2.u16.MYC_equals_0==1))"))U("((i0.u13.ERalpha_equals_0!=1)||(i3.u15.MEK1_equals_1!=1))")))&&("((i1.u3.CDK6_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))"))))
Formula 11 simplified : !X("((i1.u3.CDK6_equals_0!=1)||(i1.u4.CyclinD1_equals_1!=1))" & X(G"((i1.u4.CyclinD1_equals_1==1)&&(i2.u16.MYC_equals_0==1))" U "((i0.u13.ERalpha_equals_0!=1)||(i3.u15.MEK1_equals_1!=1))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.778864,41488,1,0,45418,34,1474,58751,47,32,139452
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA EGFr-PT-02010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X("((i0.u0.AKT1_equals_1==1)&&(i0.u13.ERalpha_equals_0==1))"))U("((((i5.i1.u1.CDK2_equals_0==1)&&(i2.u5.CyclinE1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))")))
Formula 12 simplified : !(X"((i0.u0.AKT1_equals_1==1)&&(i0.u13.ERalpha_equals_0==1))" U "((((i5.i1.u1.CDK2_equals_0==1)&&(i2.u5.CyclinE1_equals_1==1))&&(i5.i0.u17.p21_equals_0==1))&&(i5.i1.u18.p27_equals_0==1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.782668,41488,1,0,45467,34,1482,58842,47,32,139702
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA EGFr-PT-02010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 05:11:00] [INFO ] Built C files in 1166ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1590556261152
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itstools"
echo " Input is EGFr-PT-02010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389200738"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;