About the Execution of ITS-Tools for RefineWMG-PT-005006
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 282.844 | 11454.00 | 19692.00 | 60.70 | FFFFFFFFTFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572300484.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 RefineWMG-PT-005006, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572300484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.9K Apr 30 02:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 02:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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 RefineWMG-PT-005006-LTLFireability-00
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-01
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-02
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-03
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-04
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-05
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-06
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-07
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-08
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-09
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-10
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-11
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-12
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-13
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-14
FORMULA_NAME RefineWMG-PT-005006-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653084379385
Running Version 202205111006
[2022-05-20 22:06:20] [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]
[2022-05-20 22:06:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:06:20] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2022-05-20 22:06:20] [INFO ] Transformed 29 places.
[2022-05-20 22:06:20] [INFO ] Transformed 23 transitions.
[2022-05-20 22:06:20] [INFO ] Parsed PT model containing 29 places and 23 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-005006-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 12 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:20] [INFO ] Computed 12 place invariants in 14 ms
[2022-05-20 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Support contains 24 out of 29 places after structural reductions.
[2022-05-20 22:06:21] [INFO ] Flatten gal took : 21 ms
[2022-05-20 22:06:21] [INFO ] Flatten gal took : 4 ms
[2022-05-20 22:06:21] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 1888 steps, including 0 resets, run visited all 20 properties in 41 ms. (steps per millisecond=46 )
FORMULA RefineWMG-PT-005006-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(p0)))))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:21] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:21] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-00 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U p1)&&F(!p1)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
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 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 18 place count 13 transition count 13
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 10
Applied a total of 24 rules in 12 ms. Remains 10 /29 variables (removed 19) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 22:06:22] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/29 places, 10/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, true, p1, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s5 1), p0:(LT s8 1)], nbAcceptance=0, 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 RefineWMG-PT-005006-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-02 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)&&p1))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
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 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 15 transition count 13
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 13 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 12 transition count 10
Applied a total of 19 rules in 4 ms. Remains 12 /29 variables (removed 17) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-20 22:06:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-20 22:06:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-20 22:06:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-20 22:06:22] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-20 22:06:22] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/29 places, 10/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s10 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 RefineWMG-PT-005006-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-03 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(X(p1))||(!(G(p2) U !p1)&&p1))&&p0)))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:22] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-20 22:06:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s1 2) (GEQ s2 2)), p2:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1345 reset in 223 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-04 finished in 494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(p1))))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p1:(AND (GEQ s0 1) (GEQ s26 1) (GEQ s27 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 2 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-05 finished in 374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 15 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
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 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 9 transition count 9
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 9 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 5 transition count 5
Applied a total of 28 rules in 7 ms. Remains 5 /29 variables (removed 24) and now considering 5/23 (removed 18) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-20 22:06:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:06:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/29 places, 5/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/29 places, 5/23 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 5)], 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 RefineWMG-PT-005006-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-06 finished in 116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s26 1) (GEQ s27 1)), p1:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-07 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U F((G(p1)||p0))))||X((X(!p1)&&p2))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:23] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(OR (LT s1 2) (LT s2 2)), p1:(GEQ s27 1), p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 353 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:25] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-20 22:06:25] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-005006-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-005006-LTLFireability-08 finished in 1736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:25] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s25 1), p1:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-09 finished in 291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||((X(p2) U X(G(!p2))) U G(p3))))'
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:25] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:25] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:26] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:26] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:26] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 795 ms :[(AND (NOT p1) (NOT p3)), (AND p2 (NOT p1)), (AND (NOT p1) (NOT p3)), false, (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), false, p2, p2, true, (NOT p3), false, (AND (NOT p3) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND (NOT p3) (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=(AND p0 p3), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(NOT p1), acceptance={} source=2 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 13}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 14}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 15}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 16}], [{ cond=(NOT p2), acceptance={} source=7 dest: 7}, { cond=p2, acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}, { cond=(NOT p3), acceptance={0} source=10 dest: 10}, { cond=p3, acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p3) p2), acceptance={} source=12 dest: 9}, { cond=(AND p3 p2), acceptance={} source=12 dest: 17}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=14 dest: 18}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=14 dest: 19}], [{ cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=15 dest: 9}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=16 dest: 18}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={} source=16 dest: 19}, { cond=(AND (NOT p0) p3 (NOT p1) p2), acceptance={} source=16 dest: 20}, { cond=(AND p0 p3 (NOT p1) p2), acceptance={} source=16 dest: 21}], [{ cond=(NOT p3), acceptance={} source=17 dest: 9}, { cond=p3, acceptance={} source=17 dest: 17}], [{ cond=(NOT p1), acceptance={} source=18 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=20 dest: 9}, { cond=(AND p3 (NOT p1)), acceptance={} source=20 dest: 17}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=21 dest: 18}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=21 dest: 19}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=21 dest: 20}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=21 dest: 21}]], initial=0, aps=[p0:(GEQ s17 1), p3:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(GEQ s27 1), p2:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X p1), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 50 factoid took 1671 ms. Reduced automaton from 22 states, 64 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-005006-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-005006-LTLFireability-10 finished in 3027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 6 / 29 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.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
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 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 18 place count 13 transition count 13
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 13 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 10
Applied a total of 24 rules in 17 ms. Remains 10 /29 variables (removed 19) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:28] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-20 22:06:29] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/29 places, 10/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s9 1), p1:(GEQ s5 1)], 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, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-11 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1))&&(G(p0)||F(p0))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 12
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 10 transition count 9
Applied a total of 22 rules in 3 ms. Remains 10 /29 variables (removed 19) and now considering 9/23 (removed 14) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:06:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:06:29] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:06:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 22:06:29] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:06:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/29 places, 9/23 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/29 places, 9/23 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(GEQ s3 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-12 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||X(p0)||p1)) U (G(F(p2)) U !p2)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:29] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:29] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:29] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:29] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 325 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND p2 (NOT p0)), (NOT p2), (NOT p2), p2]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s7 1), p1:(GEQ s12 1), p0:(GEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33287 reset in 209 ms.
Stack based approach found an accepted trace after 44 steps with 14 reset with depth 2 and stack size 2 in 1 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-13 finished in 701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||p1)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:30] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:30] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:30] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 22:06:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2022-05-20 22:06:30] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 22:06:30] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-005006-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GEQ s5 1), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9273 reset in 174 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RefineWMG-PT-005006-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005006-LTLFireability-14 finished in 437 ms.
All properties solved by simple procedures.
Total runtime 10078 ms.
BK_STOP 1653084390839
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r186-tajo-165281572300484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005006.tgz
mv RefineWMG-PT-005006 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 ;