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

--------------------
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-00
FORMULA_NAME MAPK-PT-00080-01
FORMULA_NAME MAPK-PT-00080-02
FORMULA_NAME MAPK-PT-00080-03
FORMULA_NAME MAPK-PT-00080-04
FORMULA_NAME MAPK-PT-00080-05
FORMULA_NAME MAPK-PT-00080-06
FORMULA_NAME MAPK-PT-00080-07
FORMULA_NAME MAPK-PT-00080-08
FORMULA_NAME MAPK-PT-00080-09
FORMULA_NAME MAPK-PT-00080-10
FORMULA_NAME MAPK-PT-00080-11
FORMULA_NAME MAPK-PT-00080-12
FORMULA_NAME MAPK-PT-00080-13
FORMULA_NAME MAPK-PT-00080-14
FORMULA_NAME MAPK-PT-00080-15

=== Now, execution of the tool begins

BK_START 1620891060209

Running Version 0
[2021-05-13 07:31:03] [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 07:31:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 07:31:03] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 07:31:03] [INFO ] Transformed 22 places.
[2021-05-13 07:31:03] [INFO ] Transformed 30 transitions.
[2021-05-13 07:31:03] [INFO ] Parsed PT model containing 22 places and 30 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 07:31:03] [INFO ] Initial state test concluded for 4 properties.
FORMULA MAPK-PT-00080-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 07:31:03] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-13 07:31:03] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:31:03] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 07:31:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 07:31:03] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 07:31:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 07:31:03] [INFO ] Flatten gal took : 21 ms
FORMULA MAPK-PT-00080-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 07:31:03] [INFO ] Flatten gal took : 8 ms
[2021-05-13 07:31:03] [INFO ] Input system was already deterministic with 30 transitions.
Finished random walk after 6481 steps, including 0 resets, run visited all 19 properties in 14 ms. (steps per millisecond=462 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
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 14 place count 14 transition count 24
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 2 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 16 place count 12 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 12 transition count 21
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 12 transition count 17
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 1 with 2 rules applied. Total rules applied 25 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 11 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 11 transition count 14
Applied a total of 28 rules in 21 ms. Remains 11 /22 variables (removed 11) and now considering 14/30 (removed 16) transitions.
// Phase 1: matrix 14 rows 11 cols
[2021-05-13 07:31:03] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 07:31:03] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-13 07:31:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2021-05-13 07:31:03] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 07:31:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 10/22 places, 14/30 transitions.
Graph (trivial) has 2 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
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 12
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 07:31:03] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 07:31:03] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 07:31:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 07:31:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/22 places, 12/30 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT s4 s7), p0:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 214 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
[2021-05-13 07:31:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:31:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:31:04] [INFO ] Time to serialize gal into /tmp/LTL12903305359440462580.gal : 1 ms
[2021-05-13 07:31:04] [INFO ] Time to serialize properties into /tmp/LTL949354202080491536.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/LTL12903305359440462580.gal, -t, CGAL, -LTL, /tmp/LTL949354202080491536.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/LTL12903305359440462580.gal -t CGAL -LTL /tmp/LTL949354202080491536.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(ERKPP>=3)")))||(G("(Phase3>MEKP_Phase2)"))))
Formula 0 simplified : !(GF"(ERKPP>=3)" | G"(Phase3>MEKP_Phase2)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-13 07:31:19] [INFO ] Flatten gal took : 16 ms
[2021-05-13 07:31:19] [INFO ] Applying decomposition
[2021-05-13 07:31:19] [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/graph1446736178958129178.txt, -o, /tmp/graph1446736178958129178.bin, -w, /tmp/graph1446736178958129178.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/graph1446736178958129178.bin, -l, -1, -v, -w, /tmp/graph1446736178958129178.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:31:20] [INFO ] Decomposing Gal with order
[2021-05-13 07:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:31:20] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-13 07:31:20] [INFO ] Flatten gal took : 38 ms
[2021-05-13 07:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2021-05-13 07:31:20] [INFO ] Time to serialize gal into /tmp/LTL5626940921788102984.gal : 0 ms
[2021-05-13 07:31:20] [INFO ] Time to serialize properties into /tmp/LTL4813684986981199473.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/LTL5626940921788102984.gal, -t, CGAL, -LTL, /tmp/LTL4813684986981199473.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/LTL5626940921788102984.gal -t CGAL -LTL /tmp/LTL4813684986981199473.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(gi0.gu2.ERKPP>=3)")))||(G("(gu3.Phase3>gu3.MEKP_Phase2)"))))
Formula 0 simplified : !(GF"(gi0.gu2.ERKPP>=3)" | G"(gu3.Phase3>gu3.MEKP_Phase2)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin121837658703856931
[2021-05-13 07:31:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin121837658703856931
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/ltsmin121837658703856931]
Compilation finished in 185 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin121837658703856931]
Link finished in 47 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, ([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin121837658703856931]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-00080-00 finished in 46445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p0)) U (p1&&X(X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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:31:50] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:31:50] [INFO ] Implicit Places using invariants in 16 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 07:31:50] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 07:31:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/22 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 07:31:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:31:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00080-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={0} source=5 dest: 7}, { cond=(NOT p1), acceptance={0} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}, { cond=(NOT p1), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={0} source=8 dest: 3}, { cond=p1, acceptance={} source=8 dest: 4}, { cond=p1, acceptance={} source=8 dest: 7}]], initial=0, aps=[p1:(GT s2 s16), p0:(LEQ s6 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 279 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 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 8 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 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 17 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 17 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 26/30 (removed 4) transitions.
[2021-05-13 07:31:52] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:31:52] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 17 cols
[2021-05-13 07:31:52] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 26/30 transitions.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
[2021-05-13 07:31:52] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:31:52] [INFO ] Flatten gal took : 2 ms
[2021-05-13 07:31:52] [INFO ] Time to serialize gal into /tmp/LTL6771201063212277096.gal : 1 ms
[2021-05-13 07:31:52] [INFO ] Time to serialize properties into /tmp/LTL590059814672243728.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/LTL6771201063212277096.gal, -t, CGAL, -LTL, /tmp/LTL590059814672243728.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/LTL6771201063212277096.gal -t CGAL -LTL /tmp/LTL590059814672243728.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(ERKP<=ERK)")))U(("(Phase1>MEK_RafP)")&&(X(X(G("(Phase1>MEK_RafP)")))))))))
Formula 0 simplified : !XG(FG"(ERKP<=ERK)" U ("(Phase1>MEK_RafP)" & XXG"(Phase1>MEK_RafP)"))
Detected timeout of ITS tools.
[2021-05-13 07:32:07] [INFO ] Flatten gal took : 27 ms
[2021-05-13 07:32:07] [INFO ] Applying decomposition
[2021-05-13 07:32:07] [INFO ] Flatten gal took : 18 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/graph14358925441166563361.txt, -o, /tmp/graph14358925441166563361.bin, -w, /tmp/graph14358925441166563361.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/graph14358925441166563361.bin, -l, -1, -v, -w, /tmp/graph14358925441166563361.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:32:07] [INFO ] Decomposing Gal with order
[2021-05-13 07:32:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:32:07] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-13 07:32:07] [INFO ] Flatten gal took : 4 ms
[2021-05-13 07:32:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 0 ms.
[2021-05-13 07:32:07] [INFO ] Time to serialize gal into /tmp/LTL16315060267199043980.gal : 2 ms
[2021-05-13 07:32:07] [INFO ] Time to serialize properties into /tmp/LTL16127853350516029363.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/LTL16315060267199043980.gal, -t, CGAL, -LTL, /tmp/LTL16127853350516029363.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/LTL16315060267199043980.gal -t CGAL -LTL /tmp/LTL16127853350516029363.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(gu4.ERKP<=gu4.ERK)")))U(("(gu6.Phase1>gu6.MEK_RafP)")&&(X(X(G("(gu6.Phase1>gu6.MEK_RafP)")))))))))
Formula 0 simplified : !XG(FG"(gu4.ERKP<=gu4.ERK)" U ("(gu6.Phase1>gu6.MEK_RafP)" & XXG"(gu6.Phase1>gu6.MEK_RafP)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11264158239943629716
[2021-05-13 07:32:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11264158239943629716
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/ltsmin11264158239943629716]
Compilation finished in 170 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11264158239943629716]
Link finished in 37 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))) U ((LTLAPp1==true)&&X(X([]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11264158239943629716]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-00080-01 finished in 47686 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||F(p1)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 13 transition count 23
Graph (trivial) has 4 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
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 12 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 12 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 12 transition count 19
Applied a total of 22 rules in 6 ms. Remains 12 /22 variables (removed 10) and now considering 19/30 (removed 11) transitions.
[2021-05-13 07:32:37] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-13 07:32:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:37] [INFO ] Implicit Places using invariants in 19 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
[2021-05-13 07:32:37] [INFO ] Redundant transitions in 6 ms returned [11]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[11]
[2021-05-13 07:32:37] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 10 cols
[2021-05-13 07:32:37] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 07:32:37] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 10/22 places, 18/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 17
Applied a total of 1 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 17/18 (removed 1) transitions.
[2021-05-13 07:32:37] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 10 cols
[2021-05-13 07:32:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 07:32:37] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-13 07:32:37] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 10 cols
[2021-05-13 07:32:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 07:32:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 07:32:37] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/22 places, 17/30 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : MAPK-PT-00080-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s0), p1:(LEQ 1 s1), p2:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-04 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 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 21 place count 9 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 9 vertex of which 3 / 9 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 26 place count 7 transition count 18
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 32 place count 7 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 7 transition count 9
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 7 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 7 transition count 8
Applied a total of 38 rules in 6 ms. Remains 7 /22 variables (removed 15) and now considering 8/30 (removed 22) transitions.
// Phase 1: matrix 8 rows 7 cols
[2021-05-13 07:32:38] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 10 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-13 07:32:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-13 07:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 6/22 places, 8/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-13 07:32:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-13 07:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/22 places, 8/30 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-05 finished in 90 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
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 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 17 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 17 transition count 26
Applied a total of 10 rules in 3 ms. Remains 17 /22 variables (removed 5) and now considering 26/30 (removed 4) transitions.
[2021-05-13 07:32:38] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 17 cols
[2021-05-13 07:32:38] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
[2021-05-13 07:32:38] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:32:38] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 16 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 16/22 places, 26/30 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 24
Applied a total of 2 rules in 4 ms. Remains 16 /16 variables (removed 0) and now considering 24/26 (removed 2) transitions.
[2021-05-13 07:32:38] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 16 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-13 07:32:38] [INFO ] Flow matrix only has 23 transitions (discarded 1 similar events)
// Phase 1: matrix 23 rows 16 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/22 places, 24/30 transitions.
Stuttering acceptance computed with spot in 55 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-00080-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s12), p1:(LEQ s2 s8), p2:(LEQ s5 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00080-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-07 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 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 1 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:32:38] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 20/22 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 07:32:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA MAPK-PT-00080-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-09 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 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 0 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:32:38] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 16 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 20/22 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 07:32:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Running random walk in product with property : MAPK-PT-00080-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 163 reset in 174 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-00080-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-11 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 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 0 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:32:38] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Implicit Places using invariants in 15 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 07:32:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/22 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 07:32:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 07:32:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-12 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:(LEQ s8 s3)], 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 9121 steps with 0 reset in 16 ms.
FORMULA MAPK-PT-00080-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-12 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
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 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 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
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 8 transition count 11
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 1 with 2 rules applied. Total rules applied 35 place count 7 transition count 10
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 1 with 2 rules applied. Total rules applied 37 place count 6 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 6 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 4 transition count 5
Applied a total of 43 rules in 4 ms. Remains 4 /22 variables (removed 18) and now considering 5/30 (removed 25) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 07:32:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Implicit Places using invariants in 17 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-13 07:32:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 07:32:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 3/22 places, 5/30 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 07:32:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 07:32:39] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 07:32:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00080-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-13 finished in 90 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F((G(F(p0))||(p1&&F(p0)))))||(F(G(p2))&&F((G(F(p0))||(p1&&F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 18 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 18 transition count 27
Applied a total of 8 rules in 3 ms. Remains 18 /22 variables (removed 4) and now considering 27/30 (removed 3) transitions.
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 18 cols
[2021-05-13 07:32:39] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Implicit Places using invariants in 12 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-13 07:32:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 17 cols
[2021-05-13 07:32:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 17/22 places, 27/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-13 07:32:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 17 cols
[2021-05-13 07:32:39] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 17/22 places, 27/30 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s3), p1:(OR (GT 3 s13) (GT s6 s11)), p2:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 292 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00080-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-14 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 3 place count 20 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 15 transition count 25
Graph (trivial) has 4 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 14 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 14 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 14 transition count 21
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 14 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 14 transition count 20
Applied a total of 21 rules in 3 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2021-05-13 07:32:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Implicit Places using invariants in 14 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
[2021-05-13 07:32:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 12 cols
[2021-05-13 07:32:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 12/22 places, 20/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-13 07:32:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 07:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 12 cols
[2021-05-13 07:32:39] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 07:32:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-00080-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s0 s7), p1:(OR (GT 2 s7) (AND (GT 2 s7) (GT 1 s5)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-15 finished in 136 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-13 07:32:39] [INFO ] Applying decomposition
[2021-05-13 07:32:39] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin15822450671937369572
[2021-05-13 07:32:39] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2021-05-13 07:32:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 07:32:39] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2021-05-13 07:32:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 07:32:39] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2021-05-13 07:32:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 07:32:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15822450671937369572
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/ltsmin15822450671937369572]
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/graph556450241716333561.txt, -o, /tmp/graph556450241716333561.bin, -w, /tmp/graph556450241716333561.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/graph556450241716333561.bin, -l, -1, -v, -w, /tmp/graph556450241716333561.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 07:32:39] [INFO ] Decomposing Gal with order
[2021-05-13 07:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 07:32:39] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-13 07:32:39] [INFO ] Flatten gal took : 7 ms
[2021-05-13 07:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-13 07:32:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality13572706935402000050.gal : 1 ms
[2021-05-13 07:32:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality6346091686371142644.ltl : 4 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/LTLCardinality13572706935402000050.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6346091686371142644.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/LTLCardinality13572706935402000050.gal -t CGAL -LTL /tmp/LTLCardinality6346091686371142644.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((G(F("(gi3.gi0.gu1.ERKPP>=3)")))||(G("(gu5.Phase3>gu5.MEKP_Phase2)"))))
Formula 0 simplified : !(GF"(gi3.gi0.gu1.ERKPP>=3)" | G"(gu5.Phase3>gu5.MEKP_Phase2)")
Compilation finished in 201 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15822450671937369572]
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, -p, --pins-guards, --when, --ltl, ([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15822450671937369572]
LTSmin run took 836 ms.
FORMULA MAPK-PT-00080-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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([]((<>([]((LTLAPp2==true))) U ((LTLAPp3==true)&&X(X([]((LTLAPp3==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15822450671937369572]
LTSmin run took 648 ms.
FORMULA MAPK-PT-00080-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620891162043

--------------------
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-00080"
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-00080, 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-162075407400724"
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 [ "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 ;