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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.1K Apr 30 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 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 6.9K 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-002003-LTLFireability-00
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-01
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-02
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-03
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-04
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-05
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-06
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-07
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-08
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-09
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-10
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-11
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-12
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-13
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-14
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084276927

Running Version 202205111006
[2022-05-20 22:04:38] [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:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:04:38] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-20 22:04:38] [INFO ] Transformed 14 places.
[2022-05-20 22:04:38] [INFO ] Transformed 11 transitions.
[2022-05-20 22:04:38] [INFO ] Parsed PT model containing 14 places and 11 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-002003-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002003-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:38] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-20 22:04:38] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:38] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2022-05-20 22:04:39] [INFO ] Flatten gal took : 23 ms
[2022-05-20 22:04:39] [INFO ] Flatten gal took : 7 ms
[2022-05-20 22:04:39] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:39] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:04:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 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' '!(((G(p1)&&p0) U X(X(X(p2)))))'
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:39] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:04:39] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:39] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 683 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND p0 p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 10}, { cond=p1, acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 12}, { cond=(AND p0 p1), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 14}], [{ cond=(NOT p2), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 9}], [{ cond=(NOT p2), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={0} source=13 dest: 11}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=13 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=13 dest: 13}], [{ cond=(NOT p1), acceptance={} source=14 dest: 5}, { cond=p1, acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p2:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 3 reset in 2 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-01 finished in 901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&(G(F(p1))||G(p0)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:40] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p1), (NOT p1), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1)), p0:(LT s8 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][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-002003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-04 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((((p0 U p1)&&!p2) U G(p3))&&(G(p0) U !p2)))))'
Support contains 8 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-20 22:04:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), true, (NOT p1), (NOT p3), (NOT p3), (NOT p0), p2]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 (NOT p2)) (AND p3 p0) (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p3 (NOT p2) (NOT p1) (NOT p0)) (AND p3 p2 p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=1 dest: 5}, { cond=(AND p3 p2 p0), acceptance={} source=1 dest: 6}, { cond=(AND p3 p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(OR (AND p3 p2) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=5 dest: 4}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1)), p2:(LT s8 1), p0:(GEQ s13 1), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 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 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-05 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((G(X(!G(p0))) U G(p0)))))||X(X(p1))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:41] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:41] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:41] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:41] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:04:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s8 1), p0:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-06 finished in 682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((F((F(p0)&&p0))&&G(p1)))))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Applied a total of 7 rules in 10 ms. Remains 8 /14 variables (removed 6) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 22:04:41] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 22:04:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 22:04:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-20 22:04:42] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 22:04:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/14 places, 8/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/14 places, 8/11 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s4 5), p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-07 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(!(p0 U p1))||G(!p0)||!p0))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s13 1) (LT s5 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-08 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U X(p0)))||p1)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(LT s10 1), p0:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 162 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-002003-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-002003-LTLFireability-09 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((X(p1)&&p0)))&&X(!p1))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, true, true, true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s13 1), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-10 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 6 transition count 6
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 5 transition count 5
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 12 place count 4 transition count 4
Applied a total of 12 rules in 8 ms. Remains 4 /14 variables (removed 10) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:04:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:04:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:04:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-20 22:04:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-20 22:04:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/14 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-12 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(p1)||X(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 22:04:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s4 5), p1:(AND (GEQ s1 2) (GEQ s2 2))], 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 146 ms.
Product exploration explored 100000 steps with 50000 reset in 139 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-002003-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-002003-LTLFireability-13 finished in 539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 3 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:04:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:04:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:04:44] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:04:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:04:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-20 22:04:44] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:04:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4 5), p0:(OR (GEQ s6 1) (AND (GEQ s1 2) (GEQ s2 2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-14 finished in 168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p1)&&p0))||(p2 U !(p1 U X(p2)))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:44] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:04:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2022-05-20 22:04:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 580 ms :[true, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 11}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 13}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 11}, { cond=(AND p2 p0), acceptance={} source=2 dest: 14}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={} source=5 dest: 14}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 10}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=12 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=13 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=13 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=13 dest: 13}], [{ cond=(NOT p1), acceptance={} source=14 dest: 0}]], initial=12, aps=[p1:(GEQ s12 1), p2:(AND (GEQ s1 2) (GEQ s2 2)), p0:(AND (GEQ s1 2) (GEQ s2 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 172 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 p2 p0), (X (AND p2 p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X p1)), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 15 factoid took 583 ms. Reduced automaton from 15 states, 42 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-002003-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-002003-LTLFireability-15 finished in 1684 ms.
All properties solved by simple procedures.
Total runtime 7747 ms.

BK_STOP 1653084286166

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-002003"
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-002003, 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-165281572300468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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