Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372200178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Murphy-COL-D4N050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372200178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 11 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 22:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20K May 18 16:43 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-D4N050-LTLFireability-00
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-01
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-02
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-03
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-04
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-05
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-06
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-07
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-08
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-09
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-10
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-11
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-12
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-13
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-14
FORMULA_NAME Murphy-COL-D4N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716675035997

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N050
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-25 22:10:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 22:10:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:10:37] [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.
[2024-05-25 22:10:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 22:10:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-05-25 22:10:38] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 22:10:38] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2024-05-25 22:10:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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 1 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-25 22:10:38] [INFO ] Flatten gal took : 12 ms
[2024-05-25 22:10:38] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2024-05-25 22:10:38] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 6 ms.
[2024-05-25 22:10:38] [INFO ] Unfolded 16 HLPN properties in 0 ms.
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
[2024-05-25 22:10:38] [INFO ] Computed 6 invariants in 4 ms
[2024-05-25 22:10:38] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
[2024-05-25 22:10:38] [INFO ] Invariant cache hit.
[2024-05-25 22:10:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 22:10:38] [INFO ] Invariant cache hit.
[2024-05-25 22:10:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-25 22:10:38] [INFO ] Invariant cache hit.
[2024-05-25 22:10:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2024-05-25 22:10:38] [INFO ] Flatten gal took : 8 ms
[2024-05-25 22:10:38] [INFO ] Flatten gal took : 7 ms
[2024-05-25 22:10:38] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 22:10:38] [INFO ] Invariant cache hit.
[2024-05-25 22:10:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 22:10:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 22:10:38] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 22:10:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 22:10:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 22:10:38] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 22:10:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:38] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 22:10:38] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 22:10:38] [INFO ] After 79ms 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.1 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 5 ms. Remains 15 /30 variables (removed 15) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 22:10:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 22:10:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 15/30 places, 20/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 86 ms. (steps per millisecond=693 ) 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 47 ms. (steps per millisecond=1268 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Murphy-COL-D4N050-LTLFireability-15 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(G((X(X(p0))||G(!p0))))))'
Support contains 10 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.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 22:10:39] [INFO ] Computed 6 invariants in 8 ms
[2024-05-25 22:10:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-25 22:10:39] [INFO ] Invariant cache hit.
[2024-05-25 22:10:39] [INFO ] Implicit Places using invariants in 25 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 26 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 70 ms. Remains : 25/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 408 ms :[true, p0, (NOT p0), false, false, false, false, false, (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s4 1) (LT s9 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3110 steps with 0 reset in 20 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-00 finished in 722 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(G(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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-01 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4243 steps with 0 reset in 29 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-01 finished in 372 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(p1)&&G(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.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:40] [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.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p1:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-02 finished in 363 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' '!((F(p0) U X((!p1 U X(X(p2))))))'
Support contains 25 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.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-25 22:10:40] [INFO ] Invariant cache hit.
[2024-05-25 22:10:41] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 29 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 2 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 79 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(NOT p2), acceptance={} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (NOT (OR (GEQ s20 3) (GEQ s21 3) (GEQ s22 3) (GEQ s23 3) (GEQ s24 3))) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ...], nbAcceptance=0, 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 206 ms.
Product exploration explored 100000 steps with 25000 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 11 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Incomplete random walk after 10032 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 22:10:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 22:10:42] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 139 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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.
[2024-05-25 22:10:42] [INFO ] Invariant cache hit.
[2024-05-25 22:10:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-25 22:10:42] [INFO ] Invariant cache hit.
[2024-05-25 22:10:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 22:10:42] [INFO ] Invariant cache hit.
[2024-05-25 22:10:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 22:10:43] [INFO ] Invariant cache hit.
[2024-05-25 22:10:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 25/25 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 329 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=329 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:44] [INFO ] Invariant cache hit.
[2024-05-25 22:10:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-25 22:10:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 22:10:44] [INFO ] Invariant cache hit.
[2024-05-25 22:10:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 25/25 places, 35/35 transitions.
Built C files in :
/tmp/ltsmin15913049997315201298
[2024-05-25 22:10:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15913049997315201298
Running compilation step : cd /tmp/ltsmin15913049997315201298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin15913049997315201298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15913049997315201298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9523793069448044556.hoa' '--buchi-type=spotba'
LTSmin run took 235 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Murphy-COL-D4N050-LTLFireability-03 finished in 4007 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 22:10:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 22:10:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-25 22:10:44] [INFO ] Invariant cache hit.
[2024-05-25 22:10:45] [INFO ] Implicit Places using invariants in 28 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 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 55 ms :[p0, p0]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1) (LT 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 26463 reset in 125 ms.
Stack based approach found an accepted trace after 14034 steps with 3665 reset with depth 6 and stack size 6 in 30 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-04 finished in 305 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' '!(((F(p1)||p0) U (X(p1)||(p2 U !p3))))'
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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:45] [INFO ] Invariant cache hit.
[2024-05-25 22:10:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-25 22:10:45] [INFO ] Invariant cache hit.
[2024-05-25 22:10:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 22:10:45] [INFO ] Invariant cache hit.
[2024-05-25 22:10:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 22:10:45] [INFO ] Invariant cache hit.
[2024-05-25 22:10:45] [INFO ] Dead Transitions using invariants and state equation in 38 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 135 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p3 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p3 p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p0:(OR (AND (GEQ s0 3) (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s2 3) (GEQ s12 1) (GEQ s22 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 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) p1 p2), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p1), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT (AND p3 p2 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 20 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N050-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N050-LTLFireability-05 finished in 832 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(G(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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-06 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:(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, 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 2798 steps with 0 reset in 13 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-06 finished in 225 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' '!((F(p0)&&X(((X(p1)&&G(p2)) U p3))))'
Support contains 25 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.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-25 22:10:46] [INFO ] Invariant cache hit.
[2024-05-25 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1)), p3:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 215 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 p3 (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 87 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N050-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N050-LTLFireability-07 finished in 835 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((G((p0&&X(!p1))) U 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.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p0) p1)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s24 1)), p0:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (A...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-08 finished in 336 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(!p0)))'
Support contains 5 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Implicit Places using invariants in 58 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 59 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 96 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5165 reset in 172 ms.
Stack based approach found an accepted trace after 847 steps with 64 reset with depth 25 and stack size 25 in 3 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-09 finished in 344 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((!p0 U (G(!p1) U X(p2)))))'
Support contains 25 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.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 22:10:47] [INFO ] Invariant cache hit.
[2024-05-25 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p0:(AND (OR (LT s0 3) (LT s10 1) (LT s20 1)) (OR (LT s2 3) (LT s12 1) (LT s22 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Product exploration explored 100000 steps with 33333 reset in 159 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 p0 p2), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N050-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N050-LTLFireability-10 finished in 714 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((X((X(X(G(!p2)))&&p1))&&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.
[2024-05-25 22:10:48] [INFO ] Invariant cache hit.
[2024-05-25 22:10:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 22:10:48] [INFO ] Invariant cache hit.
[2024-05-25 22:10:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 22:10:48] [INFO ] Invariant cache hit.
[2024-05-25 22:10:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 22:10:48] [INFO ] Invariant cache hit.
[2024-05-25 22:10:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s15 1)), p1:(AND (OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s15 1)) (OR (LT s2 1) (L...], 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, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stack based approach found an accepted trace after 168 steps with 0 reset with depth 169 and stack size 169 in 1 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-11 finished in 693 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' '!(F(G((p0 U !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 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 22:10:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, 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, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7727 reset in 250 ms.
Stack based approach found an accepted trace after 592 steps with 50 reset with depth 10 and stack size 10 in 2 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-12 finished in 453 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(G(p1))&&p0)))'
Support contains 10 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.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Implicit Places using invariants in 24 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 29 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 76 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-13 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s4 1) (LT s9 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1))), p1:(AND (OR (LT s0 ...], 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 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-13 finished in 208 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((X((!(!p1 U p2)||G(p1)))&&F(p1)&&p0))))'
Support contains 10 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.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-25 22:10:49] [INFO ] Invariant cache hit.
[2024-05-25 22:10:49] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 32 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 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : Murphy-COL-D4N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s15 1) (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1)), p0:(AND (LT s15 1) (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1)), p2:(OR (GEQ s20 3) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 205 steps with 1 reset with depth 196 and stack size 196 in 0 ms.
FORMULA Murphy-COL-D4N050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLFireability-14 finished in 484 ms.
All properties solved by simple procedures.
Total runtime 12965 ms.

BK_STOP 1716675051342

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-COL-D4N050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Murphy-COL-D4N050, 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 r263-tall-171654372200178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N050.tgz
mv Murphy-COL-D4N050 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;