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-165281572400508.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-010010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 02:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 02:30 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.8K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K 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 24K 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-010010-LTLFireability-00
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-01
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-02
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-03
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-04
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-05
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-06
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-07
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-08
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-09
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-10
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-11
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-12
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-13
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-14
FORMULA_NAME RefineWMG-PT-010010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084523476

Running Version 202205111006
[2022-05-20 22:08:45] [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:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:08:45] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-20 22:08:45] [INFO ] Transformed 54 places.
[2022-05-20 22:08:45] [INFO ] Transformed 43 transitions.
[2022-05-20 22:08:45] [INFO ] Parsed PT model containing 54 places and 43 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RefineWMG-PT-010010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 12 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 22:08:46] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:46] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 22:08:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Support contains 35 out of 54 places after structural reductions.
[2022-05-20 22:08:46] [INFO ] Flatten gal took : 26 ms
[2022-05-20 22:08:46] [INFO ] Flatten gal took : 16 ms
[2022-05-20 22:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 33 out of 54 places (down from 35) after GAL structural reductions.
Finished random walk after 6285 steps, including 1 resets, run visited all 24 properties in 275 ms. (steps per millisecond=22 )
FORMULA RefineWMG-PT-010010-LTLFireability-15 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' '!(F((G(p0)&&X((X(p1) U G(F(p1)))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 4 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 35 place count 20 transition count 19
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 20 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 13 transition count 12
Applied a total of 49 rules in 40 ms. Remains 13 /54 variables (removed 41) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:08:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:08:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:08:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:08:47] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:08:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:08:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-20 22:08:47] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:08:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:08:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/54 places, 12/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/54 places, 12/43 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-00 finished in 851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
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 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 10 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-20 22:08:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/54 places, 6/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 6/43 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-01 automaton TGBA Formula[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 s5 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 RefineWMG-PT-010010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-01 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&p1))))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:48] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s4 5), p0:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1052 steps with 1 reset in 9 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-02 finished in 1980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
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 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 3 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:50] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:08:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 22:08:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-20 22:08:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/54 places, 6/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 6/43 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(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 1 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-03 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&((p1 U p2)||(p3 U p4)))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:50] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 22:08:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:50] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:50] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:50] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (OR (NOT p4) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p4)))]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p4), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p4) p3), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p0 p2) (AND p0 p4)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p4) p3), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1 (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (GEQ s23 1) (GEQ s33 1)), p4:(AND (GEQ s46 1) (GEQ s47 1) (GEQ s49 1)), p3:(GEQ s5 1), p2:(OR (GEQ s33 1) (GEQ s23 1)), p1:(GEQ s33 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, null, null][false, 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-010010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-04 finished in 604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)||X(p3)))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 14 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:51] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:51] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:51] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:51] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:51] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 8}]], initial=4, aps=[p3:(AND (GEQ s1 2) (GEQ s2 2)), p1:(OR (GEQ s40 1) (AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1))), p0:(GEQ s48 1), p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 355 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 14 factoid took 596 ms. Reduced automaton from 9 states, 22 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-010010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-010010-LTLFireability-05 finished in 1864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0)||G(p1)) U (G((X(!p0)||G(p1)))||(G(!p1)&&(X(!p0)||G(p1)))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:53] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:53] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:53] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:53] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:53] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:53] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 420 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 p1), (NOT p1), p1, (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 1}, { cond=p1, acceptance={} source=7 dest: 2}]], initial=6, aps=[p0:(OR (GEQ s15 1) (GEQ s3 3)), p1:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 97 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-06 finished in 746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:53] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:54] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:54] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 22:08:54] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:54] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:54] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:54] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s35 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][false, false]]
Product exploration explored 100000 steps with 1033 reset in 279 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-07 finished in 1055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p1))&&X((p2 U (F(p3)&&p1)))))'
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:55] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:55] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:55] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:56] [INFO ] Implicit Places using invariants in 1132 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:56] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:56] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 22:08:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 432 ms :[(NOT p0), (OR (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p1)), (NOT p3), (OR (NOT p0) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p3), acceptance={0} source=6 dest: 0}, { cond=(NOT p0), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(GEQ s13 1), p1:(GEQ s52 1), p2:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p3:(OR (AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1)) (GEQ s13 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7181 reset in 264 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 RefineWMG-PT-010010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-08 finished in 2117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2022-05-20 22:08:57] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LT s8 1), p1:(LT s37 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-09 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 30 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 40 place count 14 transition count 14
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 48 place count 14 transition count 6
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 56 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 56 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 58 place count 5 transition count 5
Applied a total of 58 rules in 5 ms. Remains 5 /54 variables (removed 49) and now considering 5/43 (removed 38) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:08:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:08:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:08:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 22:08:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-20 22:08:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/54 places, 5/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/54 places, 5/43 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 5)], 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 19 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-11 finished in 157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(p0) U G(F(!(G(!p0)||F(p1)))))))))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 18 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 11 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 3 with 2 rules applied. Total rules applied 52 place count 10 transition count 9
Applied a total of 52 rules in 5 ms. Remains 10 /54 variables (removed 44) and now considering 9/43 (removed 34) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-20 22:08:57] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/54 places, 9/43 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/54 places, 9/43 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : RefineWMG-PT-010010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s8 1), p1:(GEQ s6 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 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-LTLFireability-12 finished in 350 ms.
All properties solved by simple procedures.
Total runtime 12748 ms.

BK_STOP 1653084538263

--------------------
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-010010"
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-010010, 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-165281572400508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010010.tgz
mv RefineWMG-PT-010010 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;