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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 6.9K Apr 30 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 30 02:37 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 24K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 110K 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-050050-LTLFireability-00
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-01
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-02
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-03
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-04
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-05
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-06
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-07
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-08
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-09
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-10
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-11
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-12
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-13
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-14
FORMULA_NAME RefineWMG-PT-050050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653086346703

Running Version 202205111006
[2022-05-20 22:39:07] [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:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:39:08] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-20 22:39:08] [INFO ] Transformed 254 places.
[2022-05-20 22:39:08] [INFO ] Transformed 203 transitions.
[2022-05-20 22:39:08] [INFO ] Parsed PT model containing 254 places and 203 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-050050-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 21 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:08] [INFO ] Computed 102 place invariants in 19 ms
[2022-05-20 22:39:08] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:08] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:08] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:08] [INFO ] Computed 102 place invariants in 4 ms
[2022-05-20 22:39:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:08] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:08] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Support contains 45 out of 254 places after structural reductions.
[2022-05-20 22:39:09] [INFO ] Flatten gal took : 42 ms
[2022-05-20 22:39:09] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:39:09] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 31) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:09] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:09] [INFO ] [Real]Absence check using 102 positive place invariants in 10 ms returned sat
[2022-05-20 22:39:09] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-05-20 22:39:10] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2022-05-20 22:39:10] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-20 22:39:10] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 22:39:10] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 3451 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=164 )
Parikh walk visited 9 properties in 118 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 26 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:10] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:11] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:11] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:11] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:11] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:11] [INFO ] Computed 102 place invariants in 7 ms
[2022-05-20 22:39:11] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s171 1) (LT s172 1) (LT s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2013 steps with 0 reset in 123 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-01 finished in 1158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 11 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:12] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:12] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:12] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:12] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:12] [INFO ] Computed 102 place invariants in 27 ms
[2022-05-20 22:39:12] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:12] [INFO ] Computed 102 place invariants in 6 ms
[2022-05-20 22:39:12] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s76 1) (GEQ s77 1) (GEQ s79 1)) (AND (GEQ s246 1) (GEQ s247 1) (GEQ s249 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-03 finished in 904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U (G(p1)&&p2)))||F((G(X(p0))||p0))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:12] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:39:13] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:13] [INFO ] Computed 102 place invariants in 6 ms
[2022-05-20 22:39:13] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:13] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:13] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:13] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:13] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s248 1), p2:(GEQ s193 1), p1:(AND (GEQ s131 1) (GEQ s132 1) (GEQ s134 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 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 503 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 p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2 p1)))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050050-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLFireability-04 finished in 2024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:14] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:15] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:15] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:15] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:15] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:39:15] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:15] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:15] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-05 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 s108 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 1437 reset in 577 ms.
Stack based approach found an accepted trace after 189 steps with 4 reset with depth 4 and stack size 4 in 2 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-05 finished in 1228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!X(p0))) U !X(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:16] [INFO ] Computed 102 place invariants in 4 ms
[2022-05-20 22:39:16] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:16] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:16] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:16] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:16] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:16] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:39:16] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 206 ms :[p0, p1, p1, p1, true, (OR p1 p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=p0, acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GEQ s232 1), p1:(AND (GEQ s193 1) (GEQ s20 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 500 ms.
Product exploration explored 100000 steps with 33333 reset in 454 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 38 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050050-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLFireability-06 finished in 1869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U p2)))'
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 0 ms
[2022-05-20 22:39:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:18] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:18] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s93 1), p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p0:(AND (GEQ s66 1) (GEQ s67 1) (GEQ s69 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-07 finished in 570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G((G((!p0 U G((p1 U p2))))||p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:18] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 5 ms
[2022-05-20 22:39:18] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:18] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:19] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR p1 p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s68 1), p2:(GEQ s45 1), p0:(GEQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 484 steps with 3 reset in 3 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-08 finished in 706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G((G(F(p0))||p1))&&p2)))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:19] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:19] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:19] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:19] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LT s3 3), p1:(LT s183 1), p0:(OR (LT s171 1) (LT s172 1) (LT s174 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2209 steps with 1 reset in 24 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-09 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||G(X(p1)))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 5 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 245 place count 58 transition count 11
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 292 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 292 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 10 transition count 10
Applied a total of 294 rules in 22 ms. Remains 10 /254 variables (removed 244) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:39:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:39:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:39:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:39:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:39:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:39:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 22:39:20] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:39:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:39:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 10/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s9 1), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-10 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&F((X(p1)&&G(p1)))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:20] [INFO ] Computed 102 place invariants in 5 ms
[2022-05-20 22:39:20] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:20] [INFO ] Computed 102 place invariants in 0 ms
[2022-05-20 22:39:20] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:20] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s43 1), p1:(GEQ s253 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 643 ms.
Stack based approach found an accepted trace after 1226 steps with 0 reset with depth 1227 and stack size 1215 in 9 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-11 finished in 1358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))||G((G(p1)&&X(p2)))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:21] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:21] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:21] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:21] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:21] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:22] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:22] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s158 1), p0:(GEQ s57 1), p2:(LT s185 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 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 455 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 p1 p0 p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLFireability-12 finished in 1693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(!(true U p0)))||p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:23] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:23] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:23] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s220 1), p0:(AND (GEQ s246 1) (GEQ s247 1) (GEQ s249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 670 ms.
Stack based approach found an accepted trace after 977 steps with 0 reset with depth 978 and stack size 971 in 8 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-13 finished in 1318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((G(p0) U G(p1))||F(p2)))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:24] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:24] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:24] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:25] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:25] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:25] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:25] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:39:25] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s62 1), p0:(GEQ s28 1), p2:(LT s162 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 624 ms.
Stack based approach found an accepted trace after 19695 steps with 0 reset with depth 19696 and stack size 9972 in 210 ms.
FORMULA RefineWMG-PT-050050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLFireability-14 finished in 1777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U X(X(X(p1)))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:26] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:26] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:26] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:27] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s32 1), p1:(GEQ s188 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 822 ms.
Product exploration explored 100000 steps with 0 reset in 722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 306 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Finished random walk after 3737 steps, including 1 resets, run visited all 3 properties in 20 ms. (steps per millisecond=186 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:39:30] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:39:30] [INFO ] [Real]Absence check using 102 positive place invariants in 2 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA RefineWMG-PT-050050-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLFireability-15 finished in 3878 ms.
All properties solved by simple procedures.
Total runtime 22364 ms.

BK_STOP 1653086370488

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

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