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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:40 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.7K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K 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 56K 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-025025-LTLFireability-00
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-01
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-02
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-03
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-04
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-05
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-06
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-07
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-08
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-09
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-10
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-11
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-12
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-13
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-14
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084903843

Running Version 202205111006
[2022-05-20 22:15:05] [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:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:15:05] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-20 22:15:05] [INFO ] Transformed 129 places.
[2022-05-20 22:15:05] [INFO ] Transformed 103 transitions.
[2022-05-20 22:15:05] [INFO ] Parsed PT model containing 129 places and 103 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-025025-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:05] [INFO ] Computed 52 place invariants in 9 ms
[2022-05-20 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:05] [INFO ] Computed 52 place invariants in 6 ms
[2022-05-20 22:15:05] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:05] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:15:05] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:05] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Support contains 39 out of 129 places after structural reductions.
[2022-05-20 22:15:06] [INFO ] Flatten gal took : 28 ms
[2022-05-20 22:15:06] [INFO ] Flatten gal took : 11 ms
[2022-05-20 22:15:06] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:06] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 22:15:06] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:15:06] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-20 22:15:07] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2022-05-20 22:15:07] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 22:15:07] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-05-20 22:15:07] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Finished Parikh walk after 237 steps, including 0 resets, run visited all 11 properties in 18 ms. (steps per millisecond=13 )
Parikh walk visited 11 properties in 19 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-09 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((X(F(p0))||p1)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:07] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:15:07] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:08] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:15:08] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:08] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:08] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:08] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:15:08] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s118 1), p0:(GEQ s102 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 50000 reset in 566 ms.
Product exploration explored 100000 steps with 50000 reset in 252 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLFireability-01 finished in 1683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(G(p0))||p1) U (G(p2)&&F(p3)))))'
Support contains 9 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 63 edges and 129 vertex of which 40 / 129 are part of one of the 20 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 89 transition count 64
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 89 place count 43 transition count 41
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 105 place count 43 transition count 25
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 121 place count 27 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 121 place count 27 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 24 transition count 22
Applied a total of 127 rules in 22 ms. Remains 24 /129 variables (removed 105) and now considering 22/103 (removed 81) transitions.
// Phase 1: matrix 22 rows 24 cols
[2022-05-20 22:15:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 22:15:09] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 22 rows 24 cols
[2022-05-20 22:15:09] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-20 22:15:09] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 22 rows 24 cols
[2022-05-20 22:15:09] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-20 22:15:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-20 22:15:09] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 22 rows 24 cols
[2022-05-20 22:15:09] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 22:15:09] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/129 places, 22/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/129 places, 22/103 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) (NOT p3)), true, p0, (NOT p2), (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s17 1)), p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p3:(OR (GEQ s6 1) (GEQ s23 1)), p0:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-03 finished in 673 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 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
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 147 place count 7 transition count 7
Applied a total of 147 rules in 6 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:15:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:15:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:15:10] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:15:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-20 22:15:10] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:15:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 7/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-04 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 184 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-04 finished in 185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !F(!(F(p1)&&G(X(p1))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:10] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:10] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 22:15:10] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:10] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:10] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:10] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s55 1), p0:(GEQ s42 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 25016 reset in 394 ms.
Stack based approach found an accepted trace after 55 steps with 14 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-05 finished in 991 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X(X(X((G(p0) U G(p1))))))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:11] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:11] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:11] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-20 22:15:11] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:11] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:11] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:11] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 381 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s47 1), p0:(GEQ s93 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][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10993 steps with 0 reset in 78 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-06 finished in 934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!F(X(X(F(X(p0)))))||G(X(p1)))) U p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:12] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:12] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:15:12] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:12] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-20 22:15:12] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 381 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(GEQ s80 1), p1:(GEQ s30 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 265 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-07 finished in 837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:13] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:13] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:15:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:13] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s36 1) (GEQ s37 1) (GEQ s39 1)), p1:(GEQ s58 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-08 finished in 539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(!p0)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 22:15:13] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:13] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:13] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:13] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:14] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LT s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 338 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLFireability-11 finished in 1336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&F(p2))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 24 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:14] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:15] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:15] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:15] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:15] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 217 ms :[p1, (NOT p2), (OR (NOT p2) p1), true, (OR (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (GEQ s78 1) (GEQ s27 1)), p1:(GEQ s127 1), p2:(LT s28 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][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-025025-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-12 finished in 744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (G(!p1)||p2))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 68 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 89 place count 39 transition count 36
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 105 place count 39 transition count 20
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 121 place count 23 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 121 place count 23 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 20 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 19 transition count 16
Applied a total of 129 rules in 11 ms. Remains 19 /129 variables (removed 110) and now considering 16/103 (removed 87) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:15:15] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:15:15] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:15:15] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:15:15] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:15:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-20 22:15:15] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-20 22:15:15] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/129 places, 16/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/129 places, 16/103 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND p1 (NOT p2)), true, p1, (AND p1 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 1)), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (NOT (AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 1))) (GEQ s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-14 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:15] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:15] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:16] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:16] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:15:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:15:16] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:15:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s121 1) (GEQ s122 1) (GEQ s124 1)) (AND (GEQ s111 1) (GEQ s112 1) (GEQ s114 1))), p1:(GEQ s25 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 1311 reset in 351 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-15 finished in 733 ms.
All properties solved by simple procedures.
Total runtime 11533 ms.

BK_STOP 1653084916799

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

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025025.tgz
mv RefineWMG-PT-025025 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 ;