fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407400722
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for MAPK-PT-00080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5851.163 2998232.00 2993258.00 14288.40 FFFFTFFTFTFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407400722.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MAPK-PT-00080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 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 MAPK-PT-00080-CTLFireability-00
FORMULA_NAME MAPK-PT-00080-CTLFireability-01
FORMULA_NAME MAPK-PT-00080-CTLFireability-02
FORMULA_NAME MAPK-PT-00080-CTLFireability-03
FORMULA_NAME MAPK-PT-00080-CTLFireability-04
FORMULA_NAME MAPK-PT-00080-CTLFireability-05
FORMULA_NAME MAPK-PT-00080-CTLFireability-06
FORMULA_NAME MAPK-PT-00080-CTLFireability-07
FORMULA_NAME MAPK-PT-00080-CTLFireability-08
FORMULA_NAME MAPK-PT-00080-CTLFireability-09
FORMULA_NAME MAPK-PT-00080-CTLFireability-10
FORMULA_NAME MAPK-PT-00080-CTLFireability-11
FORMULA_NAME MAPK-PT-00080-CTLFireability-12
FORMULA_NAME MAPK-PT-00080-CTLFireability-13
FORMULA_NAME MAPK-PT-00080-CTLFireability-14
FORMULA_NAME MAPK-PT-00080-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620890837183

Running Version 0
[2021-05-13 07:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 07:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 07:27:19] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 07:27:19] [INFO ] Transformed 22 places.
[2021-05-13 07:27:19] [INFO ] Transformed 30 transitions.
[2021-05-13 07:27:19] [INFO ] Parsed PT model containing 22 places and 30 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 07:27:19] [INFO ] Reduced 1 identical enabling conditions.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 10 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:27:19] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 07:27:19] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:27:19] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 07:27:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:27:19] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:27:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 07:27:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 07:27:19] [INFO ] Flatten gal took : 27 ms
FORMULA MAPK-PT-00080-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 07:27:19] [INFO ] Flatten gal took : 9 ms
[2021-05-13 07:27:19] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=1136 ) properties (out of 69) seen :67
Running SMT prover for 2 properties.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:27:19] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 07:27:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 30
Applied a total of 1 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:27:20] [INFO ] Input system was already deterministic with 30 transitions.
Finished random walk after 8717 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1452 )
FORMULA MAPK-PT-00080-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:27:20] [INFO ] Input system was already deterministic with 30 transitions.
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:27:20] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:27:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14207715154845949351.gal : 1 ms
[2021-05-13 07:27:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15194703754997270748.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14207715154845949351.gal, -t, CGAL, -ctl, /tmp/CTLFireability15194703754997270748.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14207715154845949351.gal -t CGAL -ctl /tmp/CTLFireability15194703754997270748.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 07:27:50] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:27:50] [INFO ] Applying decomposition
[2021-05-13 07:27:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10449895201216460167.txt, -o, /tmp/graph10449895201216460167.bin, -w, /tmp/graph10449895201216460167.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10449895201216460167.bin, -l, -1, -v, -w, /tmp/graph10449895201216460167.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:27:50] [INFO ] Decomposing Gal with order
[2021-05-13 07:27:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:27:50] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 07:27:50] [INFO ] Flatten gal took : 51 ms
[2021-05-13 07:27:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 07:27:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1294291146747702345.gal : 7 ms
[2021-05-13 07:27:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2137326886644404478.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability1294291146747702345.gal, -t, CGAL, -ctl, /tmp/CTLFireability2137326886644404478.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability1294291146747702345.gal -t CGAL -ctl /tmp/CTLFireability2137326886644404478.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-13 07:28:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 2 ms
FORMULA MAPK-PT-00080-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:28:20] [INFO ] Input system was already deterministic with 30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:28:20] [INFO ] Input system was already deterministic with 30 transitions.
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:28:20] [INFO ] Flatten gal took : 18 ms
[2021-05-13 07:28:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14186155809661855178.gal : 2 ms
[2021-05-13 07:28:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16334995581257817661.ctl : 21 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14186155809661855178.gal, -t, CGAL, -ctl, /tmp/CTLFireability16334995581257817661.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14186155809661855178.gal -t CGAL -ctl /tmp/CTLFireability16334995581257817661.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 07:28:50] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:28:50] [INFO ] Applying decomposition
[2021-05-13 07:28:50] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1046050174064129023.txt, -o, /tmp/graph1046050174064129023.bin, -w, /tmp/graph1046050174064129023.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1046050174064129023.bin, -l, -1, -v, -w, /tmp/graph1046050174064129023.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:28:50] [INFO ] Decomposing Gal with order
[2021-05-13 07:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:28:50] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 07:28:50] [INFO ] Flatten gal took : 7 ms
[2021-05-13 07:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 07:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13989120637650664777.gal : 1 ms
[2021-05-13 07:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3036602220433854056.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13989120637650664777.gal, -t, CGAL, -ctl, /tmp/CTLFireability3036602220433854056.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13989120637650664777.gal -t CGAL -ctl /tmp/CTLFireability3036602220433854056.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 29
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 29/30 (removed 1) transitions.
[2021-05-13 07:29:20] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:29:20] [INFO ] Flatten gal took : 1 ms
[2021-05-13 07:29:20] [INFO ] Input system was already deterministic with 29 transitions.
[2021-05-13 07:29:20] [INFO ] Flatten gal took : 1 ms
[2021-05-13 07:29:20] [INFO ] Flatten gal took : 1 ms
[2021-05-13 07:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13192139997385042492.gal : 1 ms
[2021-05-13 07:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4514210445386618446.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13192139997385042492.gal, -t, CGAL, -ctl, /tmp/CTLFireability4514210445386618446.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13192139997385042492.gal -t CGAL -ctl /tmp/CTLFireability4514210445386618446.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 07:29:50] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:29:50] [INFO ] Applying decomposition
[2021-05-13 07:29:50] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6801427213399637238.txt, -o, /tmp/graph6801427213399637238.bin, -w, /tmp/graph6801427213399637238.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6801427213399637238.bin, -l, -1, -v, -w, /tmp/graph6801427213399637238.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:29:50] [INFO ] Decomposing Gal with order
[2021-05-13 07:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:29:50] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 07:29:50] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 07:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17576095768608451532.gal : 0 ms
[2021-05-13 07:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6897341431149846632.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17576095768608451532.gal, -t, CGAL, -ctl, /tmp/CTLFireability6897341431149846632.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17576095768608451532.gal -t CGAL -ctl /tmp/CTLFireability6897341431149846632.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 11 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 11 transition count 19
Applied a total of 22 rules in 3 ms. Remains 11 /22 variables (removed 11) and now considering 19/30 (removed 11) transitions.
[2021-05-13 07:30:20] [INFO ] Flatten gal took : 1 ms
[2021-05-13 07:30:20] [INFO ] Flatten gal took : 1 ms
[2021-05-13 07:30:20] [INFO ] Input system was already deterministic with 19 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA MAPK-PT-00080-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-13 07:30:20] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:30:20] [INFO ] Flatten gal took : 4 ms
[2021-05-13 07:30:20] [INFO ] Applying decomposition
[2021-05-13 07:30:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17695668518700225433.txt, -o, /tmp/graph17695668518700225433.bin, -w, /tmp/graph17695668518700225433.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17695668518700225433.bin, -l, -1, -v, -w, /tmp/graph17695668518700225433.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:30:26] [INFO ] Decomposing Gal with order
[2021-05-13 07:30:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:30:26] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 07:30:26] [INFO ] Flatten gal took : 6 ms
[2021-05-13 07:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 07:30:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5771432038624479173.gal : 60 ms
[2021-05-13 07:30:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7571159779887384223.ctl : 40 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5771432038624479173.gal, -t, CGAL, -ctl, /tmp/CTLFireability7571159779887384223.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5771432038624479173.gal -t CGAL -ctl /tmp/CTLFireability7571159779887384223.ctl
No direction supplied, using forward translation only.
Parsed 11 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,5.6349e+18,149.315,565008,11253,12728,677870,416843,93,2.41717e+06,47,2.04485e+06,0


Converting to forward existential form...Done !
original formula: E((A(AF((((((((((((u5.Raf_RasGTP<1)&&(i3.u3.MEK_RafP<1))&&(u1.MEKPP_Phase2<1))&&(u0.ERK_MEKPP<1))&&(u0.ERKP_MEKPP<1))&&(i3.u3.MEK_RafP<1))&&(i3.u4.RafP_Phase1<1))&&(u2.ERKP_Phase3<1))&&((u0.MEKPP<1)||(u1.Phase2<1)))&&((u1.MEKP<1)||(i3.u3.RafP<1)))&&(i3.u3.MEKP_RafP<1))) U AG(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))))) + !(A(AX(EF(((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(i3.u4.RafP_Phase1>=1))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))||((i3.u3.MEK>=1)&&(i3.u3.RafP>=1))))) U AF(EG((u5.Raf_RasGTP>=1)))))) U (!(AX(((E((i3.u3.MEKP_RafP>=1) U (((((((((u0.ERK_MEKPP>=1)||(u0.ERKP_MEKPP>=1))||(u5.Raf_RasGTP>=1))||((i3.u4.Phase1>=1)&&(i3.u3.RafP>=1)))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||(u2.ERKPP_Phase3>=1))||((u1.MEKP>=1)&&(i3.u3.RafP>=1)))||(i3.u3.MEKP_RafP>=1))) * (((((((((u0.ERK_MEKPP>=1)||(u5.Raf_RasGTP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||(i3.u4.RafP_Phase1>=1))||(u2.ERKP_Phase3>=1))||((u2.ERKP>=1)&&(u2.Phase3>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))) * (((((((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(u0.ERK_MEKPP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||(u2.ERKP_Phase3>=1))||((u5.RasGTP>=1)&&(u5.Raf>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))||(u5.Raf_RasGTP>=1))))) * (!(AF((((u0.ERK_MEKPP>=1)||((i3.u4.Phase1>=1)&&(i3.u3.RafP>=1))) * EX((((i3.u3.MEK_RafP>=1)||(i3.u4.RafP_Phase1>=1))||(u1.MEKP_Phase2>=1)))))) + ((((((((u0.ERK_MEKPP<1)&&(i3.u3.MEK_RafP<1))&&(i3.u4.RafP_Phase1<1))&&(u2.ERKPP_Phase3<1))&&(u1.MEKP_Phase2<1))&&((u2.ERKP<1)||(u0.MEKPP<1)))&&((u0.MEKPP<1)||(u1.Phase2<1)))&&((u0.MEKPP<1)||(u0.ERK<1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,(!((E(!(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))))))) U (!(!(EG(!((((((((((((u5.Raf_RasGTP<1)&&(i3.u3.MEK_RafP<1))&&(u1.MEKPP_Phase2<1))&&(u0.ERK_MEKPP<1))&&(u0.ERKP_MEKPP<1))&&(i3.u3.MEK_RafP<1))&&(i3.u4.RafP_Phase1<1))&&(u2.ERKP_Phase3<1))&&((u0.MEKPP<1)||(u1.Phase2<1)))&&((u1.MEKP<1)||(i3.u3.RafP<1)))&&(i3.u3.MEKP_RafP<1)))))) * !(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))))))))) + EG(!(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1))))))))))) + !(!((E(!(!(EG(!(EG((u5.Raf_RasGTP>=1)))))) U (!(!(EX(!(E(TRUE U ((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(i3.u4.RafP_Phase1>=1))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))||((i3.u3.MEK>=1)&&(i3.u3.RafP>=1)))))))) * !(!(EG(!(EG((u5.Raf_RasGTP>=1)))))))) + EG(!(!(EG(!(EG((u5.Raf_RasGTP>=1)))))))))))) * !(!(EX(!(((E((i3.u3.MEKP_RafP>=1) U (((((((((u0.ERK_MEKPP>=1)||(u0.ERKP_MEKPP>=1))||(u5.Raf_RasGTP>=1))||((i3.u4.Phase1>=1)&&(i3.u3.RafP>=1)))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||(u2.ERKPP_Phase3>=1))||((u1.MEKP>=1)&&(i3.u3.RafP>=1)))||(i3.u3.MEKP_RafP>=1))) * (((((((((u0.ERK_MEKPP>=1)||(u5.Raf_RasGTP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||(i3.u4.RafP_Phase1>=1))||(u2.ERKP_Phase3>=1))||((u2.ERKP>=1)&&(u2.Phase3>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))) * (((((((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(u0.ERK_MEKPP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||(u2.ERKP_Phase3>=1))||((u5.RasGTP>=1)&&(u5.Raf>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))||(u5.Raf_RasGTP>=1)))))))),!((((u0.ERK_MEKPP>=1)||((i3.u4.Phase1>=1)&&(i3.u3.RafP>=1))) * EX((((i3.u3.MEK_RafP>=1)||(i3.u4.RafP_Phase1>=1))||(u1.MEKP_Phase2>=1))))))] != FALSE + [((FwdU(Init,(!((E(!(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))))))) U (!(!(EG(!((((((((((((u5.Raf_RasGTP<1)&&(i3.u3.MEK_RafP<1))&&(u1.MEKPP_Phase2<1))&&(u0.ERK_MEKPP<1))&&(u0.ERKP_MEKPP<1))&&(i3.u3.MEK_RafP<1))&&(i3.u4.RafP_Phase1<1))&&(u2.ERKP_Phase3<1))&&((u0.MEKPP<1)||(u1.Phase2<1)))&&((u1.MEKP<1)||(i3.u3.RafP<1)))&&(i3.u3.MEKP_RafP<1)))))) * !(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))))))))) + EG(!(!(E(TRUE U !(EX((((u5.RasGTP>=1)&&(u5.Raf>=1))||((u0.MEKPP>=1)&&(u1.Phase2>=1))))))))))) + !(!((E(!(!(EG(!(EG((u5.Raf_RasGTP>=1)))))) U (!(!(EX(!(E(TRUE U ((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(i3.u4.RafP_Phase1>=1))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||((u0.MEKPP>=1)&&(u1.Phase2>=1)))||((i3.u3.MEK>=1)&&(i3.u3.RafP>=1)))))))) * !(!(EG(!(EG((u5.Raf_RasGTP>=1)))))))) + EG(!(!(EG(!(EG((u5.Raf_RasGTP>=1)))))))))))) * !(!(EX(!(((E((i3.u3.MEKP_RafP>=1) U (((((((((u0.ERK_MEKPP>=1)||(u0.ERKP_MEKPP>=1))||(u5.Raf_RasGTP>=1))||((i3.u4.Phase1>=1)&&(i3.u3.RafP>=1)))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||((u2.ERKP>=1)&&(u0.MEKPP>=1)))||(u2.ERKPP_Phase3>=1))||((u1.MEKP>=1)&&(i3.u3.RafP>=1)))||(i3.u3.MEKP_RafP>=1))) * (((((((((u0.ERK_MEKPP>=1)||(u5.Raf_RasGTP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||(i3.u4.RafP_Phase1>=1))||(u2.ERKP_Phase3>=1))||((u2.ERKP>=1)&&(u2.Phase3>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))) * (((((((((((u2.Phase3>=1)&&(u2.ERKPP>=1))||(u0.ERK_MEKPP>=1))||(u0.ERKP_MEKPP>=1))||(i3.u3.MEK_RafP>=1))||((u1.Phase2>=1)&&(u1.MEKP>=1)))||(u2.ERKP_Phase3>=1))||((u5.RasGTP>=1)&&(u5.Raf>=1)))||(u1.MEKP_Phase2>=1))||(u1.MEKPP_Phase2>=1))||(u5.Raf_RasGTP>=1)))))))) * ((((((((u0.ERK_MEKPP<1)&&(i3.u3.MEK_RafP<1))&&(i3.u4.RafP_Phase1<1))&&(u2.ERKPP_Phase3<1))&&(u1.MEKP_Phase2<1))&&((u2.ERKP<1)||(u0.MEKPP<1)))&&((u0.MEKPP<1)||(u1.Phase2<1)))&&((u0.MEKPP<1)||(u0.ERK<1))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Detected timeout of ITS tools.
[2021-05-13 07:51:26] [INFO ] Flatten gal took : 3 ms
[2021-05-13 07:51:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18210536759406230124.gal : 1 ms
[2021-05-13 07:51:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16614601373101358090.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18210536759406230124.gal, -t, CGAL, -ctl, /tmp/CTLFireability16614601373101358090.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability18210536759406230124.gal -t CGAL -ctl /tmp/CTLFireability16614601373101358090.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 08:12:27] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:12:27] [INFO ] Input system was already deterministic with 30 transitions.
[2021-05-13 08:12:27] [INFO ] Transformed 22 places.
[2021-05-13 08:12:27] [INFO ] Transformed 30 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 08:12:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6186749638308353953.gal : 0 ms
[2021-05-13 08:12:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13962868096626390766.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6186749638308353953.gal, -t, CGAL, -ctl, /tmp/CTLFireability13962868096626390766.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6186749638308353953.gal -t CGAL -ctl /tmp/CTLFireability13962868096626390766.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 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,5.6349e+18,19.142,294164,2,100033,5,1.51543e+06,6,0,121,1.57429e+06,0


Converting to forward existential form...Done !
original formula: E((A(AF((((((((((((Raf_RasGTP<1)&&(MEK_RafP<1))&&(MEKPP_Phase2<1))&&(ERK_MEKPP<1))&&(ERKP_MEKPP<1))&&(MEK_RafP<1))&&(RafP_Phase1<1))&&(ERKP_Phase3<1))&&((MEKPP<1)||(Phase2<1)))&&((MEKP<1)||(RafP<1)))&&(MEKP_RafP<1))) U AG(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1)))))) + !(A(AX(EF(((((((Phase3>=1)&&(ERKPP>=1))||(RafP_Phase1>=1))||((ERKP>=1)&&(MEKPP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEK>=1)&&(RafP>=1))))) U AF(EG((Raf_RasGTP>=1)))))) U (!(AX(((E((MEKP_RafP>=1) U (((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||((Phase1>=1)&&(RafP>=1)))||((Phase2>=1)&&(MEKP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKPP_Phase3>=1))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))) * (((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||(ERKP_Phase3>=1))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))) * (((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||(Raf_RasGTP>=1))))) * (!(AF((((ERK_MEKPP>=1)||((Phase1>=1)&&(RafP>=1))) * EX((((MEK_RafP>=1)||(RafP_Phase1>=1))||(MEKP_Phase2>=1)))))) + ((((((((ERK_MEKPP<1)&&(MEK_RafP<1))&&(RafP_Phase1<1))&&(ERKPP_Phase3<1))&&(MEKP_Phase2<1))&&((ERKP<1)||(MEKPP<1)))&&((MEKPP<1)||(Phase2<1)))&&((MEKPP<1)||(ERK<1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,(!((E(!(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1)))))))) U (!(!(EG(!((((((((((((Raf_RasGTP<1)&&(MEK_RafP<1))&&(MEKPP_Phase2<1))&&(ERK_MEKPP<1))&&(ERKP_MEKPP<1))&&(MEK_RafP<1))&&(RafP_Phase1<1))&&(ERKP_Phase3<1))&&((MEKPP<1)||(Phase2<1)))&&((MEKP<1)||(RafP<1)))&&(MEKP_RafP<1)))))) * !(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1)))))))))) + EG(!(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1))))))))))) + !(!((E(!(!(EG(!(EG((Raf_RasGTP>=1)))))) U (!(!(EX(!(E(TRUE U ((((((Phase3>=1)&&(ERKPP>=1))||(RafP_Phase1>=1))||((ERKP>=1)&&(MEKPP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEK>=1)&&(RafP>=1)))))))) * !(!(EG(!(EG((Raf_RasGTP>=1)))))))) + EG(!(!(EG(!(EG((Raf_RasGTP>=1)))))))))))) * !(!(EX(!(((E((MEKP_RafP>=1) U (((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||((Phase1>=1)&&(RafP>=1)))||((Phase2>=1)&&(MEKP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKPP_Phase3>=1))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))) * (((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||(ERKP_Phase3>=1))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))) * (((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||(Raf_RasGTP>=1)))))))),!((((ERK_MEKPP>=1)||((Phase1>=1)&&(RafP>=1))) * EX((((MEK_RafP>=1)||(RafP_Phase1>=1))||(MEKP_Phase2>=1))))))] != FALSE + [((FwdU(Init,(!((E(!(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1)))))))) U (!(!(EG(!((((((((((((Raf_RasGTP<1)&&(MEK_RafP<1))&&(MEKPP_Phase2<1))&&(ERK_MEKPP<1))&&(ERKP_MEKPP<1))&&(MEK_RafP<1))&&(RafP_Phase1<1))&&(ERKP_Phase3<1))&&((MEKPP<1)||(Phase2<1)))&&((MEKP<1)||(RafP<1)))&&(MEKP_RafP<1)))))) * !(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1)))))))))) + EG(!(!(E(TRUE U !(EX((((RasGTP>=1)&&(Raf>=1))||((MEKPP>=1)&&(Phase2>=1))))))))))) + !(!((E(!(!(EG(!(EG((Raf_RasGTP>=1)))))) U (!(!(EX(!(E(TRUE U ((((((Phase3>=1)&&(ERKPP>=1))||(RafP_Phase1>=1))||((ERKP>=1)&&(MEKPP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEK>=1)&&(RafP>=1)))))))) * !(!(EG(!(EG((Raf_RasGTP>=1)))))))) + EG(!(!(EG(!(EG((Raf_RasGTP>=1)))))))))))) * !(!(EX(!(((E((MEKP_RafP>=1) U (((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||((Phase1>=1)&&(RafP>=1)))||((Phase2>=1)&&(MEKP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKPP_Phase3>=1))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))) * (((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||(ERKP_Phase3>=1))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))) * (((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||(Raf_RasGTP>=1)))))))) * ((((((((ERK_MEKPP<1)&&(MEK_RafP<1))&&(RafP_Phase1<1))&&(ERKPP_Phase3<1))&&(MEKP_Phase2<1))&&((ERKP<1)||(MEKPP<1)))&&((MEKPP<1)||(Phase2<1)))&&((MEKPP<1)||(ERK<1))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 27/0/3
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,72.6639,994104,1,0,29,6.14984e+06,62,10,1775,6.01917e+06,34
FORMULA MAPK-PT-00080-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX((AG(AX((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKPP_Phase2>=1)))) * !(E(((Phase3>=1)&&(ERKPP>=1)) U (((((((((!(E((((((ERK_MEKPP>=1)||((Phase1>=1)&&(RafP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_Phase2>=1)) U (((((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||((Phase1>=1)&&(RafP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKPP_Phase3>=1))||(MEKP_Phase2>=1)))) + ((Phase3>=1)&&(ERKPP>=1))) + (ERK_MEKPP>=1)) + (ERKP_MEKPP>=1)) + ((Phase2>=1)&&(MEKP>=1))) + (ERKPP_Phase3>=1)) + ((ERKP>=1)&&(MEKPP>=1))) + ((ERKP>=1)&&(Phase3>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1))))))
=> equivalent forward existential formula: [((EY(Init) * !(E(TRUE U !(!(EX(!((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKPP_Phase2>=1))))))))) * !(E(((Phase3>=1)&&(ERKPP>=1)) U (((((((((!(E((((((ERK_MEKPP>=1)||((Phase1>=1)&&(RafP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_Phase2>=1)) U (((((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||((Phase1>=1)&&(RafP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKPP_Phase3>=1))||(MEKP_Phase2>=1)))) + ((Phase3>=1)&&(ERKPP>=1))) + (ERK_MEKPP>=1)) + (ERKP_MEKPP>=1)) + ((Phase2>=1)&&(MEKP>=1))) + (ERKPP_Phase3>=1)) + ((ERKP>=1)&&(MEKPP>=1))) + ((ERKP>=1)&&(Phase3>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 8/0/22
Hit Full ! (commute/partial/dont) 23/5/7
(forward)formula 1,0,114.12,1572652,1,0,53,8.61752e+06,86,21,1851,8.62045e+06,52
FORMULA MAPK-PT-00080-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(EX(((((EG(AG(((RasGTP>=1)&&(Raf>=1)))) + (MEK_RafP>=1)) + (ERKPP_Phase3>=1)) + ((Phase2>=1)&&(MEKP>=1))) + ((MEKPP>=1)&&(ERK>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(((((EG(!(E(TRUE U !(((RasGTP>=1)&&(Raf>=1)))))) + (MEK_RafP>=1)) + (ERKPP_Phase3>=1)) + ((Phase2>=1)&&(MEKP>=1))) + ((MEKPP>=1)&&(ERK>=1))))))] = FALSE
(forward)formula 2,0,121.751,1713356,1,0,62,9.39847e+06,93,26,1852,9.51702e+06,59
FORMULA MAPK-PT-00080-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(((((((AG((((RafP_Phase1>=1)||((((ERK_MEKPP<1)&&(MEK_RafP<1))&&(ERKPP_Phase3<1))&&((MEK<1)||(RafP<1))))||((((ERKP_MEKPP<1)&&((Phase1<1)||(RafP<1)))&&((RasGTP<1)||(Raf<1)))&&(MEKP_RafP<1)))) + EF((((((((((((((((EG((((((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase1>=1)&&(RafP>=1)))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1)))) + ((((((((ERK_MEKPP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((MEKP>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))&&((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(ERK>=1))))) + (ERKP_MEKPP>=1)) + ((Phase1>=1)&&(RafP>=1))) + (ERKP_Phase3>=1)) + ((MEKPP>=1)&&(Phase2>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1)) + ((Phase3>=1)&&(ERKPP>=1))) + (ERKP_MEKPP>=1)) + (MEK_RafP>=1)) + (RafP_Phase1>=1)) + (ERKPP_Phase3>=1)) + ((ERKP>=1)&&(Phase3>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1)))) + A((AG((((Phase1>=1)&&(RafP>=1))||(MEKP_RafP>=1))) + E((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||((ERKP>=1)&&(MEKPP>=1)))||((MEKP>=1)&&(RafP>=1))) U ((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(MEKPP_Phase2>=1)))) U (!(AG((((ERKPP_Phase3>=1)||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))) * A((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1))) U (((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))))))) + (RafP_Phase1>=1)) + (ERKP_Phase3>=1)) + ((RasGTP>=1)&&(Raf>=1))) + ((MEKPP>=1)&&(Phase2>=1))))
=> equivalent forward existential formula: [(FwdU(((((((FwdU(Init,TRUE) * !(((MEKPP>=1)&&(Phase2>=1)))) * !(((RasGTP>=1)&&(Raf>=1)))) * !((ERKP_Phase3>=1))) * !((RafP_Phase1>=1))) * !(!((E(!((!(!(E(TRUE U !((((ERKPP_Phase3>=1)||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))))) * !((E(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))) U (!((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1)))) * !((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))) + EG(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))))))))) U (!((!(E(TRUE U !((((Phase1>=1)&&(RafP>=1))||(MEKP_RafP>=1))))) + E((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||((ERKP>=1)&&(MEKPP>=1)))||((MEKP>=1)&&(RafP>=1))) U ((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(MEKPP_Phase2>=1))))) * !((!(!(E(TRUE U !((((ERKPP_Phase3>=1)||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))))) * !((E(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))) U (!((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1)))) * !((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))) + EG(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))))))))))) + EG(!((!(!(E(TRUE U !((((ERKPP_Phase3>=1)||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))))) * !((E(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))) U (!((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1)))) * !((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))) + EG(!((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))))))))))) * !(E(TRUE U (((((((((((((((EG((((((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase1>=1)&&(RafP>=1)))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||((MEKPP>=1)&&(ERK>=1)))) + ((((((((ERK_MEKPP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((MEKP>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))&&((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(ERK>=1))))) + (ERKP_MEKPP>=1)) + ((Phase1>=1)&&(RafP>=1))) + (ERKP_Phase3>=1)) + ((MEKPP>=1)&&(Phase2>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1)) + ((Phase3>=1)&&(ERKPP>=1))) + (ERKP_MEKPP>=1)) + (MEK_RafP>=1)) + (RafP_Phase1>=1)) + (ERKPP_Phase3>=1)) + ((ERKP>=1)&&(Phase3>=1))) + (MEKP_RafP>=1)) + (MEKPP_Phase2>=1))))),TRUE) * !((((RafP_Phase1>=1)||((((ERK_MEKPP<1)&&(MEK_RafP<1))&&(ERKPP_Phase3<1))&&((MEK<1)||(RafP<1))))||((((ERKP_MEKPP<1)&&((Phase1<1)||(RafP<1)))&&((RasGTP<1)||(Raf<1)))&&(MEKP_RafP<1)))))] = FALSE
(forward)formula 3,1,127.871,1827760,1,0,77,9.92263e+06,107,42,1891,1.0445e+07,69
FORMULA MAPK-PT-00080-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(EF(AG(EX(A(((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||((ERKP>=1)&&(MEKPP>=1)))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_RafP>=1))||((MEKPP>=1)&&(ERK>=1))) U (((((((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((E(!((((((((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))) U (!(((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||((ERKP>=1)&&(MEKPP>=1)))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_RafP>=1))||((MEKPP>=1)&&(ERK>=1)))) * !((((((((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))))) + EG(!((((((((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1)))))))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/86/30
(forward)formula 4,0,137.114,2037896,1,0,82,1.10636e+07,120,44,1967,1.15401e+07,75
FORMULA MAPK-PT-00080-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(!(E((((((MEK_RafP<1)&&((Phase2<1)||(MEKP<1)))&&(ERKPP_Phase3<1))&&((MEKPP<1)||(Phase2<1)))&&((MEKPP<1)||(ERK<1))) U EX(((((((Raf_RasGTP>=1)||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||(ERKPP_Phase3>=1))||(MEKP_Phase2>=1)) * AG(((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(ERKP_MEKPP>=1))||((Phase1>=1)&&(RafP>=1)))||((Phase2>=1)&&(MEKP>=1)))||((RasGTP>=1)&&(Raf>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((((((MEK_RafP<1)&&((Phase2<1)||(MEKP<1)))&&(ERKPP_Phase3<1))&&((MEKPP<1)||(Phase2<1)))&&((MEKPP<1)||(ERK<1))) U EX(((((((Raf_RasGTP>=1)||(ERKP_MEKPP>=1))||(MEK_RafP>=1))||(ERKPP_Phase3>=1))||(MEKP_Phase2>=1)) * !(E(TRUE U !(((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(ERKP_MEKPP>=1))||((Phase1>=1)&&(RafP>=1)))||((Phase2>=1)&&(MEKP>=1)))||((RasGTP>=1)&&(Raf>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))))))))))] != FALSE
(forward)formula 5,1,202.821,2546228,1,0,84,1.38573e+07,16,44,1516,1.43908e+07,3
FORMULA MAPK-PT-00080-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG((AX(AF(((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))) + AX((((((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||(ERKP_Phase3>=1))||(MEKPP_Phase2>=1))||(ERK_MEKPP>=1)) * AF(((((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||((Phase1>=1)&&(RafP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1)))) + EX((((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))))) * EX((((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(ERKP_Phase3>=1))||(MEKP_Phase2>=1)))) * !(EX(((MEK_RafP>=1)||(ERKP_Phase3>=1))))))))
=> equivalent forward existential formula: ((([((EY((FwdU(Init,TRUE) * !(!(EX(!(!(EG(!(((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))))))))) * !(EX((((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))) * !((((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||(ERKP_Phase3>=1))||(MEKPP_Phase2>=1))||(ERK_MEKPP>=1))))] = FALSE * [FwdG((EY((FwdU(Init,TRUE) * !(!(EX(!(!(EG(!(((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))))))))) * !(EX((((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||(ERKPP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||((MEKP>=1)&&(RafP>=1)))||(MEKP_RafP>=1))||((MEK>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1)))))),!(((((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(ERKP_MEKPP>=1))||(Raf_RasGTP>=1))||((Phase1>=1)&&(RafP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))))] = FALSE) * [(EY((FwdU(Init,TRUE) * !(!(EX(!(!(EG(!(((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))))))))) * !(EX((((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(ERKP_Phase3>=1))||(MEKP_Phase2>=1)))))] = FALSE) * [(EY(EY((FwdU(Init,TRUE) * !(!(EX(!(!(EG(!(((((ERK_MEKPP>=1)||(RafP_Phase1>=1))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))))))))))) * ((MEK_RafP>=1)||(ERKP_Phase3>=1)))] = FALSE)
(forward)formula 6,0,207.781,2546228,1,0,84,1.38573e+07,25,44,1537,1.43908e+07,9
FORMULA MAPK-PT-00080-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(EG(E((((((((((((Raf_RasGTP>=1)||(ERKPP_Phase3>=1))||(RafP_Phase1>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||((Phase3>=1)&&(ERKPP>=1)))||((Phase1>=1)&&(RafP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEKPP>=1)&&(ERK>=1)))||((ERKP>=1)&&(MEKPP>=1)))||((ERKP>=1)&&(Phase3>=1))) U E((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((Phase3>=1)&&(ERKPP>=1)))||((ERKP>=1)&&(Phase3>=1)))||((MEKP>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))) U (((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))||((Phase2>=1)&&(MEKP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||((MEKPP>=1)&&(Phase2>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E((((((((((((Raf_RasGTP>=1)||(ERKPP_Phase3>=1))||(RafP_Phase1>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||((Phase3>=1)&&(ERKPP>=1)))||((Phase1>=1)&&(RafP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||((MEKPP>=1)&&(ERK>=1)))||((ERKP>=1)&&(MEKPP>=1)))||((ERKP>=1)&&(Phase3>=1))) U E((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||(ERKPP_Phase3>=1))||((Phase3>=1)&&(ERKPP>=1)))||((ERKP>=1)&&(Phase3>=1)))||((MEKP>=1)&&(RafP>=1)))||((MEKPP>=1)&&(ERK>=1))) U (((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))||((Phase2>=1)&&(MEKP>=1)))||((ERKP>=1)&&(MEKPP>=1)))||((MEKPP>=1)&&(Phase2>=1))))))] != FALSE
Hit Full ! (commute/partial/dont) 4/0/26
Hit Full ! (commute/partial/dont) 0/0/30
(forward)formula 7,1,219.033,2546228,1,0,84,1.38573e+07,45,44,1604,1.43908e+07,20
FORMULA MAPK-PT-00080-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG((!(EF(((((MEK>=1)&&(RafP>=1))||(ERK_MEKPP>=1))||(MEKPP_Phase2>=1)))) + (((((((((ERK_MEKPP<1)&&(Raf_RasGTP<1))&&(ERKP_MEKPP<1))&&(MEK_RafP<1))&&(ERKP_Phase3<1))&&(MEKPP_Phase2<1))&&((Phase1<1)||(RafP<1)))&&((Phase2<1)||(MEKP<1)))&&((MEKPP<1)||(ERK<1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((((((((((ERK_MEKPP<1)&&(Raf_RasGTP<1))&&(ERKP_MEKPP<1))&&(MEK_RafP<1))&&(ERKP_Phase3<1))&&(MEKPP_Phase2<1))&&((Phase1<1)||(RafP<1)))&&((Phase2<1)||(MEKP<1)))&&((MEKPP<1)||(ERK<1))))),TRUE) * ((((MEK>=1)&&(RafP>=1))||(ERK_MEKPP>=1))||(MEKPP_Phase2>=1)))] = FALSE
(forward)formula 8,0,219.996,2546228,1,0,84,1.38573e+07,52,44,1645,1.43908e+07,24
FORMULA MAPK-PT-00080-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((A((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||(MEKPP_Phase2>=1)) U EG(AG((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))) + (!(AX(((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||((Phase1>=1)&&(RafP>=1)))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((ERKP>=1)&&(Phase3>=1)))||(MEKPP_Phase2>=1)))) * !(A((((AG(((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||(MEKPP_Phase2>=1))) * ((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))) * (ERKP>=1)) * (Phase3>=1)) U ((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((MEKP>=1)&&(RafP>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(EG(!(E(TRUE U !((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))))) U (!((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(ERKPP_Phase3>=1))||((ERKP>=1)&&(MEKPP>=1)))||(ERKP_Phase3>=1))||(MEKPP_Phase2>=1))) * !(EG(!(E(TRUE U !((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1))))))))) + EG(!(EG(!(E(TRUE U !((((((ERKP_MEKPP>=1)||(ERKPP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_Phase2>=1)))))))))) + (!(!(EX(!(((((((((ERK_MEKPP>=1)||(ERKP_MEKPP>=1))||((Phase1>=1)&&(RafP>=1)))||(ERKPP_Phase3>=1))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||((ERKP>=1)&&(Phase3>=1)))||(MEKPP_Phase2>=1)))))) * !(!((E(!(((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((MEKP>=1)&&(RafP>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))) U (!((((!(E(TRUE U !(((((((ERK_MEKPP>=1)||(Raf_RasGTP>=1))||((Phase2>=1)&&(MEKP>=1)))||(ERKP_Phase3>=1))||((RasGTP>=1)&&(Raf>=1)))||(MEKPP_Phase2>=1))))) * ((((((((ERK_MEKPP>=1)||((Phase3>=1)&&(ERKPP>=1)))||(Raf_RasGTP>=1))||(MEK_RafP>=1))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))) * (ERKP>=1)) * (Phase3>=1))) * !(((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((MEKP>=1)&&(RafP>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))))) + EG(!(((((((Raf_RasGTP>=1)||(MEK_RafP>=1))||(RafP_Phase1>=1))||((MEKP>=1)&&(RafP>=1)))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1)))))))))))] = FALSE
Hit Full ! (commute/partial/dont) 14/18/16
(forward)formula 9,0,264.49,2546228,1,0,84,1.38573e+07,78,44,1736,1.43908e+07,47
FORMULA MAPK-PT-00080-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(((AX(!(EX((((((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||(ERK_MEKPP>=1))||(RafP_Phase1>=1))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))))) * E((EG((((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))||(MEKPP_Phase2>=1))) * EX((Raf_RasGTP>=1))) U (Raf_RasGTP>=1))) * AF((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_Phase3>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EX(!(!(EX((((((((((((((Phase3>=1)&&(ERKPP>=1))||(ERK_MEKPP>=1))||(RafP_Phase1>=1))||((MEK>=1)&&(RafP>=1)))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))||(ERK_MEKPP>=1))||(RafP_Phase1>=1))||((ERKP>=1)&&(Phase3>=1)))||(MEKP_RafP>=1))||(MEKP_Phase2>=1))||(MEKPP_Phase2>=1))))))) * E((EG((((((((MEK_RafP>=1)||((Phase1>=1)&&(RafP>=1)))||(RafP_Phase1>=1))||((Phase2>=1)&&(MEKP>=1)))||((MEKPP>=1)&&(Phase2>=1)))||(MEKP_RafP>=1))||(MEKPP_Phase2>=1))) * EX((Raf_RasGTP>=1))) U (Raf_RasGTP>=1)))) * !(EG(!((((ERKP_MEKPP>=1)||(Raf_RasGTP>=1))||(ERKP_Phase3>=1))))))] != FALSE
(forward)formula 10,0,286.818,2553416,1,0,84,1.38573e+07,98,44,1757,1.43908e+07,60
FORMULA MAPK-PT-00080-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1620893835415

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="MAPK-PT-00080"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MAPK-PT-00080, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407400722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00080.tgz
mv MAPK-PT-00080 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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