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-162075407400780.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-10240, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.5K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:16 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-10240-00
FORMULA_NAME MAPK-PT-10240-01
FORMULA_NAME MAPK-PT-10240-02
FORMULA_NAME MAPK-PT-10240-03
FORMULA_NAME MAPK-PT-10240-04
FORMULA_NAME MAPK-PT-10240-05
FORMULA_NAME MAPK-PT-10240-06
FORMULA_NAME MAPK-PT-10240-07
FORMULA_NAME MAPK-PT-10240-08
FORMULA_NAME MAPK-PT-10240-09
FORMULA_NAME MAPK-PT-10240-10
FORMULA_NAME MAPK-PT-10240-11
FORMULA_NAME MAPK-PT-10240-12
FORMULA_NAME MAPK-PT-10240-13
FORMULA_NAME MAPK-PT-10240-14
FORMULA_NAME MAPK-PT-10240-15

=== Now, execution of the tool begins

BK_START 1620903044754

Running Version 0
[2021-05-13 10:50:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 10:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:50:46] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 10:50:46] [INFO ] Transformed 22 places.
[2021-05-13 10:50:46] [INFO ] Transformed 30 transitions.
[2021-05-13 10:50:46] [INFO ] Parsed PT model containing 22 places and 30 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 10:50:46] [INFO ] Initial state test concluded for 1 properties.
FORMULA MAPK-PT-10240-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 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 8 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 10:50:46] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-13 10:50:46] [INFO ] Implicit Places using invariants in 74 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:46] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 10:50:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:46] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 10:50:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
[2021-05-13 10:50:46] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 10:50:46] [INFO ] Flatten gal took : 20 ms
FORMULA MAPK-PT-10240-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:50:46] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:50:46] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 102440 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=1829 ) properties (out of 22) seen :4
Running SMT prover for 18 properties.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:46] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 10:50:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:46] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:47] [INFO ] Added : 22 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 18 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 4 ms.
[2021-05-13 10:50:47] [INFO ] Added : 17 causal constraints over 4 iterations in 19 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:47] [INFO ] Added : 21 causal constraints over 5 iterations in 22 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:47] [INFO ] Added : 17 causal constraints over 4 iterations in 16 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:47] [INFO ] Added : 9 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 16 causal constraints over 4 iterations in 16 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 24 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 21 causal constraints over 5 iterations in 17 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2021-05-13 10:50:47] [INFO ] Added : 19 causal constraints over 4 iterations in 16 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 18 causal constraints over 4 iterations in 14 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 18 causal constraints over 5 iterations in 18 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2021-05-13 10:50:47] [INFO ] Added : 20 causal constraints over 4 iterations in 14 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 22 causal constraints over 5 iterations in 16 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:47] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:47] [INFO ] Added : 16 causal constraints over 4 iterations in 15 ms. Result :sat
[2021-05-13 10:50:48] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 10:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:48] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 10:50:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:50:48] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:48] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-13 10:50:48] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 10:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:48] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 10:50:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:50:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 10:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:50:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:50:48] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2021-05-13 10:50:48] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 3 edges and 21 vertex of which 2 / 21 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 20 transition count 28
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 18 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 12 transition count 23
Graph (trivial) has 6 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 10 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 6 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 9 transition count 20
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 9 transition count 17
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 9 transition count 13
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 2 with 2 rules applied. Total rules applied 30 place count 8 transition count 12
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 8 transition count 11
Applied a total of 31 rules in 251 ms. Remains 8 /21 variables (removed 13) and now considering 11/30 (removed 19) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 10:50:48] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 10:50:48] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 10:50:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-13 10:50:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 10:50:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/21 places, 11/30 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-10240-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-10240-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-00 finished in 500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(X(p0))&&F(p1))||X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:48] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 10:50:48] [INFO ] Implicit Places using invariants in 12 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : MAPK-PT-10240-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT s4 s6), p0:(GT s1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 612 steps with 2 reset in 5 ms.
FORMULA MAPK-PT-10240-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-02 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Implicit Places using invariants in 12 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:48] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-10240-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s5 s8) (GT s5 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-03 finished in 111 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||F((p1||X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:50:49] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 10:50:49] [INFO ] Implicit Places using invariants in 15 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:49] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 10:50:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:50:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:50:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-10240-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ 2 s3), p2:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Product exploration explored 100000 steps with 0 reset in 330 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 261 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 7 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 17 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 17 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 4 ms. Remains 17 /20 variables (removed 3) and now considering 25/30 (removed 5) transitions.
[2021-05-13 10:50:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 10:50:50] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 17 cols
[2021-05-13 10:50:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:50:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 25/30 transitions.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
[2021-05-13 10:50:51] [INFO ] Flatten gal took : 4 ms
[2021-05-13 10:50:51] [INFO ] Flatten gal took : 3 ms
[2021-05-13 10:50:51] [INFO ] Time to serialize gal into /tmp/LTL11452877593856073637.gal : 1 ms
[2021-05-13 10:50:51] [INFO ] Time to serialize properties into /tmp/LTL11787711117792497018.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11452877593856073637.gal, -t, CGAL, -LTL, /tmp/LTL11787711117792497018.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11452877593856073637.gal -t CGAL -LTL /tmp/LTL11787711117792497018.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(ERKPP_Phase3>=1)")||(F(("(MEK>=2)")||(X("(ERK>=3)")))))))))
Formula 0 simplified : !XXG("(ERKPP_Phase3>=1)" | F("(MEK>=2)" | X"(ERK>=3)"))
Detected timeout of ITS tools.
[2021-05-13 10:51:06] [INFO ] Flatten gal took : 3 ms
[2021-05-13 10:51:06] [INFO ] Applying decomposition
[2021-05-13 10:51:06] [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/graph8273005039686420701.txt, -o, /tmp/graph8273005039686420701.bin, -w, /tmp/graph8273005039686420701.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/graph8273005039686420701.bin, -l, -1, -v, -w, /tmp/graph8273005039686420701.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 10:51:06] [INFO ] Decomposing Gal with order
[2021-05-13 10:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 10:51:06] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-13 10:51:06] [INFO ] Flatten gal took : 32 ms
[2021-05-13 10:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-13 10:51:06] [INFO ] Time to serialize gal into /tmp/LTL3510771596220164428.gal : 1 ms
[2021-05-13 10:51:06] [INFO ] Time to serialize properties into /tmp/LTL10894086086269040575.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3510771596220164428.gal, -t, CGAL, -LTL, /tmp/LTL10894086086269040575.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3510771596220164428.gal -t CGAL -LTL /tmp/LTL10894086086269040575.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(u1.ERKPP_Phase3>=1)")||(F(("(i2.u4.MEK>=2)")||(X("(i1.u2.ERK>=3)")))))))))
Formula 0 simplified : !XXG("(u1.ERKPP_Phase3>=1)" | F("(i2.u4.MEK>=2)" | X"(i1.u2.ERK>=3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin756964983852859716
[2021-05-13 10:51:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin756964983852859716
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin756964983852859716]
Compilation finished in 212 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin756964983852859716]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin756964983852859716]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-10240-04 finished in 47267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(G(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:51:36] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 10:51:36] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:51:36] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-13 10:51:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:51:36] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 10:51:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MAPK-PT-10240-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LEQ 2 s15) (LEQ s8 s4)), p0:(LEQ 1 s5), p1:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA MAPK-PT-10240-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-07 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:51:36] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 10:51:36] [INFO ] Implicit Places using invariants in 29 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:51:36] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:51:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:51:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:51:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-10240-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ s16 s14), p1:(GT 3 s6), p0:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 28/30 (removed 2) transitions.
[2021-05-13 10:51:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 10:51:37] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 17 cols
[2021-05-13 10:51:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:51:37] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 28/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
[2021-05-13 10:51:37] [INFO ] Flatten gal took : 2 ms
[2021-05-13 10:51:37] [INFO ] Flatten gal took : 3 ms
[2021-05-13 10:51:37] [INFO ] Time to serialize gal into /tmp/LTL5927837004077380951.gal : 1 ms
[2021-05-13 10:51:37] [INFO ] Time to serialize properties into /tmp/LTL14238193480554624138.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5927837004077380951.gal, -t, CGAL, -LTL, /tmp/LTL14238193480554624138.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5927837004077380951.gal -t CGAL -LTL /tmp/LTL14238193480554624138.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(MEK_RafP>=1)")||(G("(ERKP<3)")))||(F("(MEK_RafP<=RafP)")))))
Formula 0 simplified : !X("(MEK_RafP>=1)" | G"(ERKP<3)" | F"(MEK_RafP<=RafP)")
Detected timeout of ITS tools.
[2021-05-13 10:51:53] [INFO ] Flatten gal took : 2 ms
[2021-05-13 10:51:53] [INFO ] Applying decomposition
[2021-05-13 10:51:53] [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/graph13494676697106136905.txt, -o, /tmp/graph13494676697106136905.bin, -w, /tmp/graph13494676697106136905.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/graph13494676697106136905.bin, -l, -1, -v, -w, /tmp/graph13494676697106136905.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 10:51:53] [INFO ] Decomposing Gal with order
[2021-05-13 10:51:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 10:51:53] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-13 10:51:53] [INFO ] Flatten gal took : 4 ms
[2021-05-13 10:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2021-05-13 10:51:53] [INFO ] Time to serialize gal into /tmp/LTL17674376776621110857.gal : 1 ms
[2021-05-13 10:51:53] [INFO ] Time to serialize properties into /tmp/LTL7365831704158045790.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17674376776621110857.gal, -t, CGAL, -LTL, /tmp/LTL7365831704158045790.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17674376776621110857.gal -t CGAL -LTL /tmp/LTL7365831704158045790.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gu5.MEK_RafP>=1)")||(G("(gi0.gu0.ERKP<3)")))||(F("(gu5.MEK_RafP<=gu5.RafP)")))))
Formula 0 simplified : !X("(gu5.MEK_RafP>=1)" | G"(gi0.gu0.ERKP<3)" | F"(gu5.MEK_RafP<=gu5.RafP)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14108739927515842159
[2021-05-13 10:52:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14108739927515842159
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14108739927515842159]
Compilation finished in 154 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14108739927515842159]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||[]((LTLAPp1==true))||<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14108739927515842159]
LTSmin run took 247 ms.
FORMULA MAPK-PT-10240-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-10240-12 finished in 31865 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&((X((p1&&X(G(p0))))&&F(p2))||X(G((p1&&X(G(p0))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:52:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 10:52:08] [INFO ] Implicit Places using invariants in 19 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:52:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 10:52:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:52:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:52:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-10240-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(GT s17 s14), p0:(GT 1 s11), p1:(GT s11 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-13 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p1)||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 17 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 11 place count 13 transition count 24
Graph (trivial) has 8 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 11 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 18 place count 9 transition count 20
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 24 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 9 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 9 transition count 13
Applied a total of 26 rules in 4 ms. Remains 9 /21 variables (removed 12) and now considering 13/30 (removed 17) transitions.
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 10:52:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 10:52:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 10:52:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 10:52:08] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-13 10:52:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 10:52:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 10:52:08] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/21 places, 13/30 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MAPK-PT-10240-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s5 s8), p1:(LEQ 2 s1), p2:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-14 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0&&F(p1)) U (p2||X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 10:52:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 10:52:08] [INFO ] Implicit Places using invariants in 12 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:52:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:52:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 20/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 10:52:09] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 10:52:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MAPK-PT-10240-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s7), p0:(GT 2 s9), p1:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1595 reset in 115 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-10240-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-15 finished in 298 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15671215316396547805
[2021-05-13 10:52:09] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2021-05-13 10:52:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 10:52:09] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2021-05-13 10:52:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 10:52:09] [INFO ] Applying decomposition
[2021-05-13 10:52:09] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2021-05-13 10:52:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 10:52:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15671215316396547805
[2021-05-13 10:52:09] [INFO ] Flatten gal took : 2 ms
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15671215316396547805]
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/graph17642378369565678513.txt, -o, /tmp/graph17642378369565678513.bin, -w, /tmp/graph17642378369565678513.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/graph17642378369565678513.bin, -l, -1, -v, -w, /tmp/graph17642378369565678513.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 10:52:09] [INFO ] Decomposing Gal with order
[2021-05-13 10:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 10:52:09] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-13 10:52:09] [INFO ] Flatten gal took : 3 ms
[2021-05-13 10:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-13 10:52:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality14457289600969289062.gal : 1 ms
[2021-05-13 10:52:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality14771787067993060273.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality14457289600969289062.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14771787067993060273.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality14457289600969289062.gal -t CGAL -LTL /tmp/LTLCardinality14771787067993060273.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(u0.ERKPP_Phase3>=1)")||(F(("(i2.u2.MEK>=2)")||(X("(i1.u3.ERK>=3)")))))))))
Formula 0 simplified : !XXG("(u0.ERKPP_Phase3>=1)" | F("(i2.u2.MEK>=2)" | X"(i1.u3.ERK>=3)"))
Compilation finished in 190 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15671215316396547805]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15671215316396547805]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.219: LTL layer: formula: X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.219: "X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.219: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.242: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.248: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.455: DFS-FIFO for weak LTL, using special progress label 34
pins2lts-mc-linux64( 0/ 8), 0.456: There are 35 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.456: State length is 22, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.456: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.456: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.456: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.456: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.602: ~1 levels ~960 states ~5504 transitions
pins2lts-mc-linux64( 3/ 8), 0.617: ~1 levels ~1920 states ~13352 transitions
pins2lts-mc-linux64( 1/ 8), 0.624: ~1 levels ~3840 states ~25536 transitions
pins2lts-mc-linux64( 1/ 8), 0.627: ~1 levels ~7680 states ~55088 transitions
pins2lts-mc-linux64( 2/ 8), 0.644: ~1 levels ~15360 states ~122960 transitions
pins2lts-mc-linux64( 2/ 8), 0.668: ~1 levels ~30720 states ~260688 transitions
pins2lts-mc-linux64( 2/ 8), 0.712: ~1 levels ~61440 states ~551696 transitions
pins2lts-mc-linux64( 1/ 8), 0.832: ~1 levels ~122880 states ~1093312 transitions
pins2lts-mc-linux64( 6/ 8), 1.068: ~1 levels ~245760 states ~2513320 transitions
pins2lts-mc-linux64( 6/ 8), 1.594: ~1 levels ~491520 states ~5214080 transitions
pins2lts-mc-linux64( 1/ 8), 2.602: ~1 levels ~983040 states ~10084064 transitions
pins2lts-mc-linux64( 1/ 8), 4.503: ~1 levels ~1966080 states ~21153320 transitions
pins2lts-mc-linux64( 1/ 8), 8.506: ~1 levels ~3932160 states ~44367408 transitions
pins2lts-mc-linux64( 1/ 8), 17.182: ~1 levels ~7864320 states ~91912168 transitions
pins2lts-mc-linux64( 1/ 8), 36.781: ~1 levels ~15728640 states ~191464736 transitions
pins2lts-mc-linux64( 1/ 8), 80.970: ~1 levels ~31457280 states ~395897848 transitions
pins2lts-mc-linux64( 1/ 8), 172.757: ~1 levels ~62914560 states ~821106696 transitions
pins2lts-mc-linux64( 6/ 8), 350.758: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 350.788:
pins2lts-mc-linux64( 0/ 8), 350.788: mean standard work distribution: 5.5% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 350.788:
pins2lts-mc-linux64( 0/ 8), 350.788: Explored 104716153 states 1516457517 transitions, fanout: 14.482
pins2lts-mc-linux64( 0/ 8), 350.788: Total exploration time 350.320 sec (350.300 sec minimum, 350.308 sec on average)
pins2lts-mc-linux64( 0/ 8), 350.788: States per second: 298916, Transitions per second: 4328778
pins2lts-mc-linux64( 0/ 8), 350.788:
pins2lts-mc-linux64( 0/ 8), 350.788: Progress states detected: 134217181
pins2lts-mc-linux64( 0/ 8), 350.788: Redundant explorations: -21.9801
pins2lts-mc-linux64( 0/ 8), 350.788:
pins2lts-mc-linux64( 0/ 8), 350.788: Queue width: 8B, total height: 59215541, memory: 451.78MB
pins2lts-mc-linux64( 0/ 8), 350.788: Tree memory: 1157.6MB, 9.0 B/state, compr.: 10.0%
pins2lts-mc-linux64( 0/ 8), 350.788: Tree fill ratio (roots/leafs): 99.0%/52.0%
pins2lts-mc-linux64( 0/ 8), 350.788: Stored 30 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 350.788: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 350.788: Est. total memory use: 1609.4MB (~1475.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15671215316396547805]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||<>(((LTLAPp1==true)||X((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15671215316396547805]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 11:12:36] [INFO ] Flatten gal took : 2 ms
[2021-05-13 11:12:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality11141848822775422737.gal : 0 ms
[2021-05-13 11:12:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality9527690192386707664.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality11141848822775422737.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9527690192386707664.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality11141848822775422737.gal -t CGAL -LTL /tmp/LTLCardinality9527690192386707664.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(ERKPP_Phase3>=1)")||(F(("(MEK>=2)")||(X("(ERK>=3)")))))))))
Formula 0 simplified : !XXG("(ERKPP_Phase3>=1)" | F("(MEK>=2)" | X"(ERK>=3)"))
Detected timeout of ITS tools.
[2021-05-13 11:33:03] [INFO ] Flatten gal took : 2 ms
[2021-05-13 11:33:03] [INFO ] Input system was already deterministic with 30 transitions.
[2021-05-13 11:33:03] [INFO ] Transformed 21 places.
[2021-05-13 11:33:03] [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 11:33:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality13108697467956440471.gal : 1 ms
[2021-05-13 11:33:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality10387388232678654628.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality13108697467956440471.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10387388232678654628.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality13108697467956440471.gal -t CGAL -LTL /tmp/LTLCardinality10387388232678654628.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("(ERKPP_Phase3>=1)")||(F(("(MEK>=2)")||(X("(ERK>=3)")))))))))
Formula 0 simplified : !XXG("(ERKPP_Phase3>=1)" | F("(MEK>=2)" | X"(ERK>=3)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-10240"
export BK_EXAMINATION="LTLCardinality"
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-10240, examination is LTLCardinality"
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-162075407400780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-10240.tgz
mv MAPK-PT-10240 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;