About the Execution of ITS-Tools for RefineWMG-PT-050051
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
324.579 | 17111.00 | 30236.00 | 56.00 | TFTFFFFFFFFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400563.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-050051, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400563
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 02:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 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-050051-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653086407852
Running Version 202205111006
[2022-05-20 22:40:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:40:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:40:09] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-05-20 22:40:09] [INFO ] Transformed 254 places.
[2022-05-20 22:40:09] [INFO ] Transformed 203 transitions.
[2022-05-20 22:40:09] [INFO ] Parsed PT model containing 254 places and 203 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RefineWMG-PT-050051-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 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 20 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:40:09] [INFO ] Computed 102 place invariants in 17 ms
[2022-05-20 22:40:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:09] [INFO ] Computed 102 place invariants in 6 ms
[2022-05-20 22:40:09] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:09] [INFO ] Computed 102 place invariants in 5 ms
[2022-05-20 22:40:10] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:10] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:10] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Support contains 38 out of 254 places after structural reductions.
[2022-05-20 22:40:10] [INFO ] Flatten gal took : 49 ms
[2022-05-20 22:40:10] [INFO ] Flatten gal took : 25 ms
[2022-05-20 22:40:10] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 23) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:11] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:11] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 22:40:11] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2022-05-20 22:40:11] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 22:40:12] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 195 ms.
[2022-05-20 22:40:12] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 801 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=133 )
Parikh walk visited 12 properties in 938 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
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 22 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:40:13] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:13] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:13] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:14] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:14] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:14] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:14] [INFO ] Computed 102 place invariants in 6 ms
[2022-05-20 22:40:14] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s197 s223) (GT s199 s35)), p0:(LEQ s155 s176)], 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 559 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050051-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-00 finished in 2018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&G(p1))) U X(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 6 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:40:15] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:15] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:15] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:15] [INFO ] Computed 102 place invariants in 22 ms
[2022-05-20 22:40:16] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:16] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:40:16] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s224 s10), p0:(GT 1 s137), p1:(LEQ s185 s102)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 475 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 p2 (NOT p0) p1), (X p2), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050051-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-02 finished in 1811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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 13 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:40:17] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:17] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:17] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:17] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:17] [INFO ] Computed 102 place invariants in 9 ms
[2022-05-20 22:40:17] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:17] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s181 s52)], 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 1190 reset in 1081 ms.
Stack based approach found an accepted trace after 220 steps with 86 reset with depth 19 and stack size 19 in 2 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-03 finished in 1733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(((F(p1)&&p0) U F((G(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 12 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:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s146 s240), p0:(LEQ s76 s203)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-04 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(G(p1) U (!p0 U 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 7 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:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40: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:40:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}]], initial=0, aps=[p2:(LEQ 3 s161), p0:(GT 2 s186), p1:(GT 2 s20)], 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][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-050051-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-05 finished in 884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F((F(p0)||p0)) U (p1 U p2)))'
Support contains 4 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 144 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 3 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 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 192 place count 62 transition count 60
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 233 place count 62 transition count 19
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 274 place count 21 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 274 place count 21 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 17 transition count 15
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 284 place count 16 transition count 14
Applied a total of 284 rules in 15 ms. Remains 16 /254 variables (removed 238) and now considering 14/203 (removed 189) transitions.
// Phase 1: matrix 14 rows 16 cols
[2022-05-20 22:40:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 14 rows 16 cols
[2022-05-20 22:40:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2022-05-20 22:40:20] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-20 22:40:20] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2022-05-20 22:40:20] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 14/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/254 places, 14/203 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 2 s5), p0:(LEQ 3 s15), p1:(LEQ s9 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-06 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&X(p1))))'
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 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:40:21] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:21] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:21] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:21] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:40:21] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:21] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 118 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 :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GT 2 s82) (GT s61 s48)) (GT 2 s78)), p1:(GT 2 s185)], 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 368 steps with 0 reset in 6 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-08 finished in 658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X((X(X(G(X(p0))))&&F(p1)))))))'
Support contains 4 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 145 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 1 with 141 rules applied. Total rules applied 190 place count 62 transition count 59
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 231 place count 62 transition count 18
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 272 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 272 place count 21 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 17 transition count 14
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 282 place count 16 transition count 13
Applied a total of 282 rules in 11 ms. Remains 16 /254 variables (removed 238) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:40:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:40:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:40:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:40:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:40:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 22:40:21] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-20 22:40:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 13/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s5 s12), p0:(LEQ s9 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-09 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(((!X(p0) U p1)&&G(X(p0)))))))'
Support contains 4 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 1 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 240 place count 58 transition count 16
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 43 rules applied. Total rules applied 283 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 15 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 284 place count 15 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 288 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 12 transition count 12
Applied a total of 290 rules in 19 ms. Remains 12 /254 variables (removed 242) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-20 22:40:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-20 22:40:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2022-05-20 22:40:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 22:40:22] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2022-05-20 22:40:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/254 places, 12/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s10 s8), p0:(LEQ s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 679 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-10 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U X((G(!p0)||G(F(p1))))))||p1)))'
Support contains 4 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 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 193 place count 60 transition count 58
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 233 place count 60 transition count 18
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 41 rules applied. Total rules applied 274 place count 20 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 275 place count 19 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 275 place count 19 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 281 place count 16 transition count 14
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 4 with 2 rules applied. Total rules applied 283 place count 15 transition count 13
Applied a total of 283 rules in 8 ms. Remains 15 /254 variables (removed 239) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 22:40:22] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/254 places, 13/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s5 s8), p0:(GT s13 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-12 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(!(X(p0) U 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 10 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:40:22] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:23] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:23] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:23] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:23] [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 113 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 3 s208) (GT 1 s232)), p0:(GT 2 s161)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 584 ms.
Product exploration explored 100000 steps with 33333 reset in 584 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-050051-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-14 finished in 2034 ms.
All properties solved by simple procedures.
Total runtime 15701 ms.
BK_STOP 1653086424963
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-050051"
export BK_EXAMINATION="LTLCardinality"
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-050051, examination is LTLCardinality"
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-165281572400563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;