About the Execution of LoLa+red for Murphy-COL-D4N025
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 484.044 | 25198.00 | 37228.00 | 538.80 | FFFFFFFFTFTFFFTF | 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.r519-tall-167987245100316.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 Murphy-COL-D4N025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245100316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D4N025-LTLFireability-00
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-01
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-02
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-03
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-04
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-05
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-06
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-07
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-08
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-09
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-10
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-11
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-12
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-13
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-14
FORMULA_NAME Murphy-COL-D4N025-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1680938619576
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=Murphy-COL-D4N025
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-08 07:23:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:23:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:23:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:23:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 410 ms
[2023-04-08 07:23:41] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:23:42] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 6 ms.
[2023-04-08 07:23:42] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D4N025-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-08 07:23:42] [INFO ] Flatten gal took : 13 ms
[2023-04-08 07:23:42] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:23:42] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 7 ms.
[2023-04-08 07:23:42] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D4N025-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:23:42] [INFO ] Computed 6 invariants in 3 ms
[2023-04-08 07:23:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2023-04-08 07:23:42] [INFO ] Invariant cache hit.
[2023-04-08 07:23:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:23:42] [INFO ] Invariant cache hit.
[2023-04-08 07:23:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-08 07:23:42] [INFO ] Invariant cache hit.
[2023-04-08 07:23:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-08 07:23:42] [INFO ] Flatten gal took : 8 ms
[2023-04-08 07:23:42] [INFO ] Flatten gal took : 8 ms
[2023-04-08 07:23:42] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:23:42] [INFO ] Invariant cache hit.
[2023-04-08 07:23:42] [INFO ] [Real]Absence check using 2 positive place invariants in 33 ms returned sat
[2023-04-08 07:23:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:42] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:23:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-04-08 07:23:42] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:42] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:42] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-08 07:23:42] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 15 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 7 ms. Remains 15 /30 variables (removed 15) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-04-08 07:23:42] [INFO ] Computed 0 invariants in 1 ms
[2023-04-08 07:23:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 15/30 places, 20/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 96 ms. (steps per millisecond=621 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 49 ms. (steps per millisecond=1216 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Murphy-COL-D4N025-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Murphy-COL-D4N025-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Murphy-COL-D4N025-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&G(p1)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:23:43] [INFO ] Computed 6 invariants in 3 ms
[2023-04-08 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 30/30 places, 35/35 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT s4 3) (LT s14 1) (LT s24 1)) (OR (LT s1 3) (LT s11 1) (LT s21 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 17 steps with 0 reset in 3 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-03 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1 U p2)||p0))))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), 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:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s1 1) (GEQ s6 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 25000 reset in 215 ms.
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 545 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=272 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:45] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 907 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=226 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Product exploration explored 100000 steps with 25000 reset in 167 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-08 finished in 3612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(F(p2)&&p1)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 39 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s11 2) (LT s16 1)) (OR (LT s12 2) (LT s17 1)) (OR (LT s10 2) (LT s15 1)) (OR (LT s13 2) (LT s18 1)) (OR (LT s14 2) (LT s19 1)) (OR (LT s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 43 reset in 276 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-09 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT s4 3) (LT s14 1) (LT s24 1)) (OR (LT s1 3) (LT s11 1) (LT s21 1)...], 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 24215 reset in 202 ms.
Product exploration explored 100000 steps with 24261 reset in 214 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] After 41ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N025-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N025-LTLFireability-10 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Implicit Places using invariants in 39 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-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:(OR (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s10 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 26382 reset in 123 ms.
Stack based approach found an accepted trace after 25373 steps with 6705 reset with depth 6 and stack size 6 in 36 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-11 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(X(!p1))||(!p1&&F(p2))))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Implicit Places using invariants in 29 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 30 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 816 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, p1, p1, (NOT p2), (AND (NOT p2) p1), false]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 11}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 11}, { cond=(NOT p0), acceptance={} source=5 dest: 13}, { cond=p0, acceptance={} source=5 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 15}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 16}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 17}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 18}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=11 dest: 11}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=11 dest: 12}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=12 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 18}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=12 dest: 19}], [{ cond=p1, acceptance={} source=13 dest: 1}, { cond=p1, acceptance={} source=13 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=14 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=14 dest: 5}], [{ cond=p1, acceptance={} source=15 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 13}, { cond=(AND p1 p0), acceptance={} source=16 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=16 dest: 15}, { cond=(AND p1 p0), acceptance={0} source=16 dest: 16}], [{ cond=(NOT p2), acceptance={0} source=17 dest: 17}], [{ cond=(NOT p2), acceptance={} source=18 dest: 3}, { cond=(NOT p2), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=19 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=19 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=19 dest: 18}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=19 dest: 19}]], initial=0, aps=[p0:(OR (GEQ s20 3) (GEQ s21 3) (GEQ s22 3) (GEQ s23 3) (GEQ s24 3)), p1:(OR (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s10 1)), p2:(OR (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76 steps with 1 reset in 1 ms.
FORMULA Murphy-COL-D4N025-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLFireability-12 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((!p0&&X(!p0)) U !p1))||X(X(F(p2)))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:50] [INFO ] Invariant cache hit.
[2023-04-08 07:23:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:23:50] [INFO ] Invariant cache hit.
[2023-04-08 07:23:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:23:50] [INFO ] Invariant cache hit.
[2023-04-08 07:23:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:23:50] [INFO ] Invariant cache hit.
[2023-04-08 07:23:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s3 1) (LT s8 1) (LT s13 1)) (OR (LT s1 1) (LT s6 1) (LT s11 1)) (O...], 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 313 reset in 228 ms.
Product exploration explored 100000 steps with 321 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 425 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 385 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 211 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:52] [INFO ] Invariant cache hit.
[2023-04-08 07:23:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:23:52] [INFO ] Invariant cache hit.
[2023-04-08 07:23:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:23:52] [INFO ] Invariant cache hit.
[2023-04-08 07:23:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:23:52] [INFO ] Invariant cache hit.
[2023-04-08 07:23:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 118 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 372 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 208 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 222 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 363 reset in 274 ms.
Product exploration explored 100000 steps with 323 reset in 285 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:23:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-15 finished in 4792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1 U p2)||p0))))))'
Found a Shortening insensitive property : Murphy-COL-D4N025-LTLFireability-08
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-08 07:23:55] [INFO ] Invariant cache hit.
[2023-04-08 07:23:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122 ms. Remains : 30/30 places, 35/35 transitions.
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), 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:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s1 1) (GEQ s6 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 279 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:23:56] [INFO ] Invariant cache hit.
[2023-04-08 07:23:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 333 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=166 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:23:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-08 finished in 3007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((!p0&&X(!p0)) U !p1))||X(X(F(p2)))))'
Found a Shortening insensitive property : Murphy-COL-D4N025-LTLFireability-15
Stuttering acceptance computed with spot in 280 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:23:58] [INFO ] Invariant cache hit.
[2023-04-08 07:23:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:23:59] [INFO ] Invariant cache hit.
[2023-04-08 07:23:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:23:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:23:59] [INFO ] Invariant cache hit.
[2023-04-08 07:23:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 123 ms. Remains : 30/30 places, 35/35 transitions.
Running random walk in product with property : Murphy-COL-D4N025-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s7 1) (LT s12 1)) (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s3 1) (LT s8 1) (LT s13 1)) (OR (LT s1 1) (LT s6 1) (LT s11 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 312 reset in 223 ms.
Product exploration explored 100000 steps with 366 reset in 247 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 307 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=153 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 212 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:00] [INFO ] Invariant cache hit.
[2023-04-08 07:24:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:24:01] [INFO ] Invariant cache hit.
[2023-04-08 07:24:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Finished random walk after 444 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=111 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 284 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 187 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 375 reset in 263 ms.
Product exploration explored 100000 steps with 354 reset in 276 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:24:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:24:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-08 07:24:03] [INFO ] Invariant cache hit.
[2023-04-08 07:24:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 30/30 places, 35/35 transitions.
Treatment of property Murphy-COL-D4N025-LTLFireability-15 finished in 4973 ms.
[2023-04-08 07:24:03] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:24:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-08 07:24:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 22007 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Murphy-COL-D4N025
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA Murphy-COL-D4N025-LTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Murphy-COL-D4N025-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1680938644774
--------------------
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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Murphy-COL-D4N025-LTLFireability-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Murphy-COL-D4N025-LTLFireability-08
lola: result : true
lola: markings : 826
lola: fired transitions : 1990
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Murphy-COL-D4N025-LTLFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Murphy-COL-D4N025-LTLFireability-15
lola: result : false
lola: markings : 2578
lola: fired transitions : 3852
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Murphy-COL-D4N025-LTLFireability-08: LTL true LTL model checker
Murphy-COL-D4N025-LTLFireability-15: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="Murphy-COL-D4N025"
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 Murphy-COL-D4N025, 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 r519-tall-167987245100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N025.tgz
mv Murphy-COL-D4N025 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 ;