About the Execution of LoLa+red for RefineWMG-PT-005005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
315.607 | 8523.00 | 12793.00 | 313.90 | 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-167889199800548.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-005005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199800548
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:49 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.6K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:52 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 14K 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-005005-LTLFireability-00
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-01
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-02
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-03
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-04
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-05
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-06
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-07
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-08
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-09
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-10
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-11
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-12
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-13
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-14
FORMULA_NAME RefineWMG-PT-005005-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679052317053
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-005005
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 11:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:25:18] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-17 11:25:18] [INFO ] Transformed 29 places.
[2023-03-17 11:25:18] [INFO ] Transformed 23 transitions.
[2023-03-17 11:25:18] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 86 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 3 formulas.
FORMULA RefineWMG-PT-005005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 8 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-17 11:25:18] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-17 11:25:19] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
[2023-03-17 11:25:19] [INFO ] Invariant cache hit.
[2023-03-17 11:25:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:25:19] [INFO ] Invariant cache hit.
[2023-03-17 11:25:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-17 11:25:19] [INFO ] Invariant cache hit.
[2023-03-17 11:25:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 21 out of 29 places after structural reductions.
[2023-03-17 11:25:19] [INFO ] Flatten gal took : 16 ms
[2023-03-17 11:25:19] [INFO ] Flatten gal took : 5 ms
[2023-03-17 11:25:19] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 473 steps, including 0 resets, run visited all 20 properties in 43 ms. (steps per millisecond=11 )
FORMULA RefineWMG-PT-005005-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' '!((F(p0) U G(p1)))'
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
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 9 place count 19 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 18 transition count 14
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 13 place count 17 transition count 14
Applied a total of 13 rules in 11 ms. Remains 17 /29 variables (removed 12) and now considering 14/23 (removed 9) transitions.
// Phase 1: matrix 14 rows 17 cols
[2023-03-17 11:25:19] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-17 11:25:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 11:25:19] [INFO ] Invariant cache hit.
[2023-03-17 11:25:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 11:25:19] [INFO ] Invariant cache hit.
[2023-03-17 11:25:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-17 11:25:19] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/29 places, 14/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 17/29 places, 14/23 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(AND (LT s15 1) (GEQ s11 1) (GEQ s12 1) (GEQ s14 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 3 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-00 finished in 413 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 (p1&&X(X(G(p2))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-17 11:25:20] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-17 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s3 3) (AND (GEQ s1 2) (GEQ s2 2))), p0:(GEQ s7 1), p2:(GEQ s4 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 93 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-01 finished in 540 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)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-17 11:25:20] [INFO ] Invariant cache hit.
[2023-03-17 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s23 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-02 finished in 242 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 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s28 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 14946 reset in 215 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-005005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-03 finished in 426 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((G(F(p0))||(F(p0)&&G(F(p1))))))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 11:25:21] [INFO ] Invariant cache hit.
[2023-03-17 11:25:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s27 1), p1:(GEQ s3 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2352 reset in 176 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-05 finished in 637 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 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 11 transition count 11
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 11 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 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 3 with 2 rules applied. Total rules applied 27 place count 7 transition count 7
Applied a total of 27 rules in 7 ms. Remains 7 /29 variables (removed 22) and now considering 7/23 (removed 16) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-17 11:25:22] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 11:25:22] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/29 places, 7/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 7/29 places, 7/23 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-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 s6 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 1 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-07 finished in 170 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&&F(p1)))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-17 11:25:22] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [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:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s15 1), p1:(LT s22 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42141 steps with 505 reset in 65 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-08 finished in 308 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(((F(p0)||G((p0 U p1))) U p2))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 12
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 11 transition count 10
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 22 place count 10 transition count 9
Applied a total of 22 rules in 6 ms. Remains 10 /29 variables (removed 19) and now considering 9/23 (removed 14) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 11:25:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 11:25:22] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/29 places, 9/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 10/29 places, 9/23 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s8 1), p0:(GEQ s6 1), p1:(GEQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-09 finished in 302 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||G((p1 U !p2))||X(F(p1)))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-17 11:25:22] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-17 11:25:22] [INFO ] Invariant cache hit.
[2023-03-17 11:25:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p2:(LT s27 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 1303 reset in 147 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 130 in 1 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-11 finished in 449 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(p1)||X(F(!p1)))&&p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 3) (GEQ s18 1)), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 2869 reset in 146 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-12 finished in 354 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))))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-13 finished in 270 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((G(!p0) U (p1 U (G(p1)||(p1&&G(p2)))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 10 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 15 transition count 14
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 15 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 13 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 13 transition count 11
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 21 place count 12 transition count 11
Applied a total of 21 rules in 8 ms. Remains 12 /29 variables (removed 17) and now considering 11/23 (removed 12) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-17 11:25:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 11:25:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-17 11:25:23] [INFO ] Invariant cache hit.
[2023-03-17 11:25:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 11:25:24] [INFO ] Invariant cache hit.
[2023-03-17 11:25:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 11:25:24] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-17 11:25:24] [INFO ] Invariant cache hit.
[2023-03-17 11:25:24] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/29 places, 11/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 12/29 places, 11/23 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), true, p0, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-005005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 1}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s8 1), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p2:(LT s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-LTLFireability-14 finished in 516 ms.
All properties solved by simple procedures.
Total runtime 5953 ms.
ITS solved all properties within timeout
BK_STOP 1679052325576
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-005005"
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-005005, 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-167889199800548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005005.tgz
mv RefineWMG-PT-005005 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 ;