About the Execution of ITS-Tools for RefineWMG-PT-025025
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 499.107 | 15655.00 | 27413.00 | 236.70 | FFFFFFFFFFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197400612.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RefineWMG-PT-025025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197400612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-00
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-01
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-02
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-03
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-04
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-05
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-06
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-07
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-08
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-09
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-10
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-11
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-12
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-13
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-14
FORMULA_NAME RefineWMG-PT-025025-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679021622864
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-025025
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 02:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 02:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 02:53:44] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-17 02:53:44] [INFO ] Transformed 129 places.
[2023-03-17 02:53:44] [INFO ] Transformed 103 transitions.
[2023-03-17 02:53:44] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-025025-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 190 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 02:53:44] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-17 02:53:45] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
[2023-03-17 02:53:45] [INFO ] Invariant cache hit.
[2023-03-17 02:53:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-17 02:53:45] [INFO ] Invariant cache hit.
[2023-03-17 02:53:45] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-17 02:53:45] [INFO ] Invariant cache hit.
[2023-03-17 02:53:45] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 39 out of 129 places after structural reductions.
[2023-03-17 02:53:45] [INFO ] Flatten gal took : 39 ms
[2023-03-17 02:53:45] [INFO ] Flatten gal took : 21 ms
[2023-03-17 02:53:45] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 30) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-17 02:53:46] [INFO ] Invariant cache hit.
[2023-03-17 02:53:46] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-17 02:53:46] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 02:53:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 43 ms returned sat
[2023-03-17 02:53:46] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 02:53:46] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-17 02:53:46] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 452 steps, including 0 resets, run visited all 9 properties in 27 ms. (steps per millisecond=16 )
Parikh walk visited 9 properties in 29 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)&&G((p2||X(p3)))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:47] [INFO ] Invariant cache hit.
[2023-03-17 02:53:47] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
[2023-03-17 02:53:47] [INFO ] Invariant cache hit.
[2023-03-17 02:53:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-17 02:53:47] [INFO ] Invariant cache hit.
[2023-03-17 02:53:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-17 02:53:47] [INFO ] Invariant cache hit.
[2023-03-17 02:53:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s88 1), p0:(GEQ s92 1), p2:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1)), p3:(LT s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 14 reset in 4 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-00 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(F((!p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 9 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:48] [INFO ] Invariant cache hit.
[2023-03-17 02:53:48] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
[2023-03-17 02:53:48] [INFO ] Invariant cache hit.
[2023-03-17 02:53:48] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-17 02:53:48] [INFO ] Invariant cache hit.
[2023-03-17 02:53:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-17 02:53:48] [INFO ] Invariant cache hit.
[2023-03-17 02:53:48] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p1), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ 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=(OR (AND p1 (NOT p2)) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND p1 (NOT p2)) p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s13 1), p0:(GEQ s85 1), p2:(AND (LT s83 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][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-025025-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-01 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 4 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 114 place count 35 transition count 15
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 133 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 133 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 13 transition count 12
Applied a total of 139 rules in 21 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 02:53:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 02:53:49] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 12/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s6 1) (AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-03 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p1 U p2)&&p0))&&F(G(p3)))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 67 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 91 place count 39 transition count 37
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 17 rules applied. Total rules applied 108 place count 39 transition count 20
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 125 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 125 place count 22 transition count 17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 19 transition count 17
Applied a total of 131 rules in 15 ms. Remains 19 /129 variables (removed 110) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-17 02:53:49] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-17 02:53:49] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/129 places, 17/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 19/129 places, 17/103 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} 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=[p0:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1)), p2:(LT s8 1), p1:(GEQ s5 1), p3:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], 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-025025-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-05 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0&&(p1 U p2)))) U G(p3)))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 02:53:49] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-17 02:53:49] [INFO ] Invariant cache hit.
[2023-03-17 02:53:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p0)), true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=6 dest: 7}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=7 dest: 4}, { cond=(OR (AND p3 p0 p2) (AND p3 p0 p1)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(LT s15 1), p0:(GEQ s57 1), p2:(GEQ s110 1), p1:(AND (GEQ s106 1) (GEQ s107 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19958 reset in 440 ms.
Product exploration explored 100000 steps with 20033 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X p3), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 709 ms. Reduced automaton from 9 states, 20 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 432 ms :[(NOT p3), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), true, (NOT p2), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), false, (AND p3 p1 (NOT p2) p0), false]
Incomplete random walk after 10024 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 02:53:52] [INFO ] Invariant cache hit.
[2023-03-17 02:53:52] [INFO ] [Real]Absence check using 52 positive place invariants in 5 ms returned sat
[2023-03-17 02:53:52] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 02:53:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-17 02:53:52] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 02:53:52] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-17 02:53:52] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 597 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=39 )
Parikh walk visited 4 properties in 15 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X p3), (X (X p3)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (AND p3 p1 p0 p2)), (F (AND p3 (NOT p1) p0 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND p3 (NOT p1) (NOT p2)) (AND p3 (NOT p0))))), (F (AND (NOT p3) p1 p0 (NOT p2))), (F (AND p3 p1 p0 (NOT p2))), (F (OR (AND p1 p0) (AND p0 p2))), (F (NOT p3)), (F (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0)))), (F (OR (AND (NOT p3) p1 p0) (AND (NOT p3) p0 p2))), (F (OR (AND p3 p1 p0) (AND p3 p0 p2))), (F (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0))))
Knowledge based reduction with 10 factoid took 418 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-025025-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLFireability-07 finished in 3563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 17 rules applied. Total rules applied 109 place count 37 transition count 18
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 126 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 126 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 16 transition count 14
Applied a total of 134 rules in 14 ms. Remains 16 /129 variables (removed 113) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-17 02:53:53] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 02:53:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 02:53:53] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/129 places, 14/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 16/129 places, 14/103 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1) (GEQ s6 1) (GEQ s8 1)), p1:(GEQ s8 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 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-08 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||F(p1)))||G(p2)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 02:53:53] [INFO ] Computed 52 place invariants in 6 ms
[2023-03-17 02:53:53] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-17 02:53:53] [INFO ] Invariant cache hit.
[2023-03-17 02:53:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s28 1), p0:(AND (GEQ s101 1) (GEQ s102 1) (GEQ s104 1)), p2:(LT s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2638 reset in 326 ms.
Stack based approach found an accepted trace after 74 steps with 2 reset with depth 54 and stack size 52 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-09 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:54] [INFO ] Invariant cache hit.
[2023-03-17 02:53:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
[2023-03-17 02:53:54] [INFO ] Invariant cache hit.
[2023-03-17 02:53:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 02:53:54] [INFO ] Invariant cache hit.
[2023-03-17 02:53:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-17 02:53:54] [INFO ] Invariant cache hit.
[2023-03-17 02:53:54] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s87 1) (GEQ s8 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2682 reset in 320 ms.
Stack based approach found an accepted trace after 27 steps with 1 reset with depth 4 and stack size 4 in 1 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-11 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:55] [INFO ] Invariant cache hit.
[2023-03-17 02:53:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2023-03-17 02:53:55] [INFO ] Invariant cache hit.
[2023-03-17 02:53:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 02:53:55] [INFO ] Invariant cache hit.
[2023-03-17 02:53:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-17 02:53:55] [INFO ] Invariant cache hit.
[2023-03-17 02:53:55] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s25 1), p1:(LT s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-025025-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLFireability-12 finished in 1050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p1))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s97 1), p1:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2870 steps with 0 reset in 11 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-13 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((p1 U p2)||G(!p1)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:56] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-17 02:53:56] [INFO ] Invariant cache hit.
[2023-03-17 02:53:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), p1, true]
Running random walk in product with property : RefineWMG-PT-025025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s68 1), p2:(AND (GEQ s27 1) (GEQ s68 1)), p1:(GEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2640 reset in 352 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLFireability-15 finished in 859 ms.
All properties solved by simple procedures.
Total runtime 13309 ms.
BK_STOP 1679021638519
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-025025"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-025025, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197400612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025025.tgz
mv RefineWMG-PT-025025 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;