About the Execution of LoLa+red for RefineWMG-PT-002003
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
326.619 | 8435.00 | 13402.00 | 285.50 | FFFFFFFFFFFFFFFF | 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.r327-tall-167889199700540.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 lolaxred
Input is RefineWMG-PT-002003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199700540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 16:02 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.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:04 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 6.9K 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-002003-LTLFireability-00
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-01
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-02
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-03
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-04
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-05
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-06
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-07
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-08
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-09
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-10
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-11
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-12
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-13
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-14
FORMULA_NAME RefineWMG-PT-002003-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679052241194
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-002003
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:24:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 11:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:24:02] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-17 11:24:02] [INFO ] Transformed 14 places.
[2023-03-17 11:24:02] [INFO ] Transformed 11 transitions.
[2023-03-17 11:24:02] [INFO ] Parsed PT model containing 14 places and 11 transitions and 32 arcs in 85 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 1 formulas.
FORMULA RefineWMG-PT-002003-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-17 11:24:03] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-17 11:24:03] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
[2023-03-17 11:24:03] [INFO ] Invariant cache hit.
[2023-03-17 11:24:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:24:03] [INFO ] Invariant cache hit.
[2023-03-17 11:24:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 11:24:03] [INFO ] Invariant cache hit.
[2023-03-17 11:24:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-17 11:24:03] [INFO ] Flatten gal took : 12 ms
[2023-03-17 11:24:03] [INFO ] Flatten gal took : 3 ms
[2023-03-17 11:24:03] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 11:24:03] [INFO ] Invariant cache hit.
[2023-03-17 11:24:03] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-17 11:24:03] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA RefineWMG-PT-002003-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Performed 1 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 0 with 2 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 8 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 11:24:03] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 11:24:04] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-01 finished in 366 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((X(p0)||F(p1)))||F(G(p2))))'
Support contains 7 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-17 11:24:04] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 113 ms :[(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-002003-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1)), p2:(LT s13 1)], 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 10687 reset in 231 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 9 and stack size 8 in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-02 finished in 461 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 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-17 11:24:04] [INFO ] Invariant cache hit.
[2023-03-17 11:24:04] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 115 ms :[(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-002003-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1)), p0:(GEQ s3 3), p2:(AND (GEQ s1 2) (GEQ s2 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20520 reset in 130 ms.
Stack based approach found an accepted trace after 334 steps with 65 reset with depth 18 and stack size 17 in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-03 finished in 391 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)||G(!p1))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Performed 1 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 0 with 2 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 2 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 11:24:05] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 11:24:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 11:24:05] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 1), p1:(GEQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-04 finished in 175 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((G(p0)||F((G(F(!p1))||(F(!p1)&&(!p2||F(p0)))))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-17 11:24:05] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 11:24:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 11:24:05] [INFO ] Invariant cache hit.
[2023-03-17 11:24:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s8 1), p2:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1)), p1:(GEQ s3 3)], 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]]
Product exploration explored 100000 steps with 22995 reset in 184 ms.
Stack based approach found an accepted trace after 302 steps with 73 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-06 finished in 631 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)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 7 transition count 6
Applied a total of 7 rules in 2 ms. Remains 7 /14 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-17 11:24:05] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-17 11:24:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 7/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-07 finished in 202 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(X(F(p0)))))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-17 11:24:06] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s7 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 5055 reset in 96 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-08 finished in 378 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((F(p0)&&(p1 U !p2)))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 241 ms :[p2, (NOT p0), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(LT s10 1), p1:(GEQ s5 1), p0:(AND (LT s5 1) (OR (LT s0 1) (LT s11 1) (LT s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-09 finished in 374 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(X(X(F(p0))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:06] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 11:24:06] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 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 8696 reset in 120 ms.
Stack based approach found an accepted trace after 25 steps with 2 reset with depth 11 and stack size 11 in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-10 finished in 414 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)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20641 reset in 76 ms.
Stack based approach found an accepted trace after 17 steps with 4 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-11 finished in 258 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(G(p0))||((!p1&&F(!p0)) U (G((G(!p1)||(!p1&&F(!p0))))||((G(!p1)||(!p1&&F(!p0)))&&G(p2))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 11:24:07] [INFO ] Invariant cache hit.
[2023-03-17 11:24:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (OR (NOT p2) p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p2), p1, (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 7}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND p1 p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=10 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=10 dest: 10}]], initial=2, aps=[p2:(LT s7 1), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s1 2) (GEQ s2 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-12 finished in 534 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(!p0)&&(X(F(!p0))||G(p1))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s13 1), p1:(GEQ s4 5)], 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 26905 reset in 71 ms.
Stack based approach found an accepted trace after 35 steps with 11 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-002003-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-13 finished in 298 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 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 5 transition count 5
Applied a total of 10 rules in 6 ms. Remains 5 /14 variables (removed 9) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-17 11:24:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 11:24:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 11:24:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:24:08] [INFO ] Invariant cache hit.
[2023-03-17 11:24:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 5/14 places, 5/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-002003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 5)], 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-002003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-002003-LTLFireability-14 finished in 180 ms.
All properties solved by simple procedures.
Total runtime 6015 ms.
ITS solved all properties within timeout
BK_STOP 1679052249629
--------------------
content from stderr:
+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-002003"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is RefineWMG-PT-002003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199700540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-002003.tgz
mv RefineWMG-PT-002003 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;