About the Execution of ITS-Tools for ERK-PT-000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 492.735 | 36663.00 | 44573.00 | 223.70 | FTFFFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875600573.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 ERK-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875600573
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-000100-00
FORMULA_NAME ERK-PT-000100-01
FORMULA_NAME ERK-PT-000100-02
FORMULA_NAME ERK-PT-000100-03
FORMULA_NAME ERK-PT-000100-04
FORMULA_NAME ERK-PT-000100-05
FORMULA_NAME ERK-PT-000100-06
FORMULA_NAME ERK-PT-000100-07
FORMULA_NAME ERK-PT-000100-08
FORMULA_NAME ERK-PT-000100-09
FORMULA_NAME ERK-PT-000100-10
FORMULA_NAME ERK-PT-000100-11
FORMULA_NAME ERK-PT-000100-12
FORMULA_NAME ERK-PT-000100-13
FORMULA_NAME ERK-PT-000100-14
FORMULA_NAME ERK-PT-000100-15
=== Now, execution of the tool begins
BK_START 1620628944193
Running Version 0
[2021-05-10 06:42:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-10 06:42:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 06:42:25] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-10 06:42:25] [INFO ] Transformed 11 places.
[2021-05-10 06:42:25] [INFO ] Transformed 11 transitions.
[2021-05-10 06:42:25] [INFO ] Parsed PT model containing 11 places and 11 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 7 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:25] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-10 06:42:25] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:42:25] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:42:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
[2021-05-10 06:42:26] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-10 06:42:26] [INFO ] Flatten gal took : 16 ms
FORMULA ERK-PT-000100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000100-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000100-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 06:42:26] [INFO ] Flatten gal took : 4 ms
[2021-05-10 06:42:26] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 94874 steps, including 2 resets, run visited all 11 properties in 53 ms. (steps per millisecond=1790 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants in 32 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ERK-PT-000100-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1), p2:(AND (GEQ s4 1) (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 29539 reset in 191 ms.
Stack based approach found an accepted trace after 24 steps with 9 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ERK-PT-000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-00 finished in 451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 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 11 transition count 10
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 9 transition count 10
Applied a total of 3 rules in 9 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 06:42:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants in 22 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
[2021-05-10 06:42:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 7/11 places, 10/11 transitions.
Graph (trivial) has 4 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 9/10 (removed 1) transitions.
[2021-05-10 06:42:26] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-10 06:42:26] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-000100-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-03 finished in 118 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 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 10 transition count 8
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 6 place count 8 transition count 8
Applied a total of 6 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 06:42:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants in 21 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
[2021-05-10 06:42:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 6/11 places, 8/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-10 06:42:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ERK-PT-000100-04 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:(GEQ s3 1), p1:(GEQ s2 1)], 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 1 ms.
FORMULA ERK-PT-000100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-04 finished in 141 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 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Implicit Places using invariants in 16 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 16 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 06:42:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:42:26] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-000100-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], 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 5850 reset in 112 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ERK-PT-000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-05 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:42:27] [INFO ] Implicit Places using invariants in 12 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:27] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, false, p0, false]
Running random walk in product with property : ERK-PT-000100-06 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1))], 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 93 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 85 ms :[p0, false, p0, false]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 83 ms :[p0, false, p0, false]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 11/11 transitions.
Graph (trivial) has 5 edges and 9 vertex of which 4 / 9 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.
Applied a total of 1 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2021-05-10 06:42:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:42:27] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 06:42:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 9/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
[2021-05-10 06:42:28] [INFO ] Flatten gal took : 2 ms
[2021-05-10 06:42:28] [INFO ] Flatten gal took : 2 ms
[2021-05-10 06:42:28] [INFO ] Time to serialize gal into /tmp/LTL3763922412663927690.gal : 1 ms
[2021-05-10 06:42:28] [INFO ] Time to serialize properties into /tmp/LTL1182360538259029753.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/LTL3763922412663927690.gal, -t, CGAL, -LTL, /tmp/LTL1182360538259029753.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/LTL3763922412663927690.gal -t CGAL -LTL /tmp/LTL1182360538259029753.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((MEKPP>=1)&&(ERK>=1))"))||(X(X(F("((MEKPP<1)||(ERK<1))"))))))
Formula 0 simplified : !(G"((MEKPP>=1)&&(ERK>=1))" | XXF"((MEKPP<1)||(ERK<1))")
Detected timeout of ITS tools.
[2021-05-10 06:42:43] [INFO ] Flatten gal took : 2 ms
[2021-05-10 06:42:43] [INFO ] Applying decomposition
[2021-05-10 06:42:43] [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/graph4366799486737396494.txt, -o, /tmp/graph4366799486737396494.bin, -w, /tmp/graph4366799486737396494.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/graph4366799486737396494.bin, -l, -1, -v, -w, /tmp/graph4366799486737396494.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 06:42:43] [INFO ] Decomposing Gal with order
[2021-05-10 06:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 06:42:43] [INFO ] Flatten gal took : 37 ms
[2021-05-10 06:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 06:42:43] [INFO ] Time to serialize gal into /tmp/LTL10604068708799985877.gal : 1 ms
[2021-05-10 06:42:43] [INFO ] Time to serialize properties into /tmp/LTL6505563257331974064.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/LTL10604068708799985877.gal, -t, CGAL, -LTL, /tmp/LTL6505563257331974064.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/LTL10604068708799985877.gal -t CGAL -LTL /tmp/LTL6505563257331974064.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((u3.MEKPP>=1)&&(u3.ERK>=1))"))||(X(X(F("((u3.MEKPP<1)||(u3.ERK<1))"))))))
Formula 0 simplified : !(G"((u3.MEKPP>=1)&&(u3.ERK>=1))" | XXF"((u3.MEKPP<1)||(u3.ERK<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8449919600784244902
[2021-05-10 06:42:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8449919600784244902
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/ltsmin8449919600784244902]
Compilation finished in 159 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8449919600784244902]
Link finished in 36 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))||X(X(<>(!(LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8449919600784244902]
LTSmin run took 371 ms.
FORMULA ERK-PT-000100-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-000100-06 finished in 31898 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 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 11 transition count 10
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 3 place count 9 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 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 8 transition count 7
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 9 place count 6 transition count 7
Applied a total of 9 rules in 3 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2021-05-10 06:42:58] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 06:42:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:58] [INFO ] Implicit Places using invariants in 8 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
[2021-05-10 06:42:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:42:58] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 06:42:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 06:42:58] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 5/11 places, 7/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-10 06:42:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:42:58] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 06:42:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 5/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-000100-07 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:(GEQ s2 1)], 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 0 ms.
FORMULA ERK-PT-000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-07 finished in 95 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 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 11 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-000100-08 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:(OR (GEQ s5 1) (AND (GEQ s6 1) (GEQ s7 1)))], 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 5343 steps with 0 reset in 6 ms.
FORMULA ERK-PT-000100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-08 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(!p0) U G(!p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 10 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), true, (AND (NOT p1) p0), p1, p1]
Running random walk in product with property : ERK-PT-000100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s8 1)), p1:(GEQ s5 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA ERK-PT-000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-11 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 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 11 transition count 10
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 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 8 transition count 8
Applied a total of 7 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
[2021-05-10 06:42:59] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-10 06:42:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 11 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-10 06:42:59] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:42:59] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/11 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-10 06:42:59] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 06:42:59] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 23 ms :[p0]
Running random walk in product with property : ERK-PT-000100-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], 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 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-12 finished in 75 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&(G(F(p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 11 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 06:42:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 06:42:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-000100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(OR (LT s5 1) (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ERK-PT-000100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-13 finished in 179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||F(p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 10 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-000100-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s3 1), p1:(OR (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s7 1) (GEQ s8 1))), p2:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14813 reset in 110 ms.
Stack based approach found an accepted trace after 12 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ERK-PT-000100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-14 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 06:42:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 24 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
[2021-05-10 06:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Graph (trivial) has 2 edges and 9 vertex of which 2 / 9 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.
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 06:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 06:42:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ERK-PT-000100-15 automaton TGBA [mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s7 1)), p1:(GEQ s3 1), p0:(GEQ s2 1)], 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 ERK-PT-000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-000100-15 finished in 180 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620628980856
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ERK-PT-000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 ERK-PT-000100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875600573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000100.tgz
mv ERK-PT-000100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;