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.r329-tall-171662362300458.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 RefineWMG-PT-025026, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362300458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 13 05:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 05:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K 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 RefineWMG-PT-025026-LTLFireability-00
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-01
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-02
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-03
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-04
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-05
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-06
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-07
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-08
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-09
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-10
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-11
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-12
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-13
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-14
FORMULA_NAME RefineWMG-PT-025026-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716863426785

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=RefineWMG-PT-025026
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:30:28] [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-28 02:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:30:28] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-28 02:30:28] [INFO ] Transformed 129 places.
[2024-05-28 02:30:28] [INFO ] Transformed 103 transitions.
[2024-05-28 02:30:28] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-025026-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 13 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:28] [INFO ] Computed 52 invariants in 13 ms
[2024-05-28 02:30:28] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
[2024-05-28 02:30:28] [INFO ] Invariant cache hit.
[2024-05-28 02:30:28] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 02:30:28] [INFO ] Invariant cache hit.
[2024-05-28 02:30:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 02:30:28] [INFO ] Invariant cache hit.
[2024-05-28 02:30:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 44 out of 129 places after structural reductions.
[2024-05-28 02:30:29] [INFO ] Flatten gal took : 29 ms
[2024-05-28 02:30:29] [INFO ] Flatten gal took : 11 ms
[2024-05-28 02:30:29] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 31) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-28 02:30:29] [INFO ] Invariant cache hit.
[2024-05-28 02:30:29] [INFO ] [Real]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-28 02:30:29] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-28 02:30:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2024-05-28 02:30:30] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-28 02:30:30] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-28 02:30:30] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 72 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 11 properties in 17 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p0||G((X(G((p2||G(p0))))&&p1))))))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:30:30] [INFO ] Invariant cache hit.
[2024-05-28 02:30:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-28 02:30:30] [INFO ] Invariant cache hit.
[2024-05-28 02:30:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 02:30:30] [INFO ] Invariant cache hit.
[2024-05-28 02:30:30] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-28 02:30:30] [INFO ] Invariant cache hit.
[2024-05-28 02:30:31] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 129/129 places, 103/103 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 332 ms :[true, (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-00 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=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LT s122 1), p1:(AND (LT s50 1) (OR (LT s6 1) (LT s7 1) (LT s9 1))), p2:(AND (LT s50 1) (OR (LT s6 1) (LT s7 1) (LT s9 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-00 finished in 649 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(p0)&&F(p1)&&X(X(F(p2)))))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:30:31] [INFO ] Invariant cache hit.
[2024-05-28 02:30:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-28 02:30:31] [INFO ] Invariant cache hit.
[2024-05-28 02:30:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 02:30:31] [INFO ] Invariant cache hit.
[2024-05-28 02:30:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-28 02:30:31] [INFO ] Invariant cache hit.
[2024-05-28 02:30:31] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1)), p1:(GEQ s28 1), p2:(GEQ s95 1)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 212 reset in 592 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-01 finished in 1144 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&&(p1 U X(X(X((p2 U G(p0)))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 5 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 18 rules applied. Total rules applied 113 place count 35 transition count 16
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 131 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 131 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 13 transition count 12
Applied a total of 139 rules in 18 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-28 02:30:32] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:30:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:30:32] [INFO ] Invariant cache hit.
[2024-05-28 02:30:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:30:32] [INFO ] Invariant cache hit.
[2024-05-28 02:30:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:30:32] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:30:32] [INFO ] Invariant cache hit.
[2024-05-28 02:30:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 12/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 623 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 10}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 10}, { cond=p1, acceptance={0} source=5 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p0 p1), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=8 dest: 10}, { cond=(AND p0 p1), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=8 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND p0 p1), acceptance={} source=10 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 p1), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p0 p1), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(AND p0 p1), acceptance={} source=13 dest: 11}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s5 1), p2:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-02 finished in 783 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 X(X(X(G(p1))))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:33] [INFO ] Computed 52 invariants in 2 ms
[2024-05-28 02:30:33] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (GEQ s36 1) (GEQ s37 1) (GEQ s39 1)), p0:(AND (GEQ s80 1) (GEQ s106 1) (GEQ s107 1) (GEQ s109 1))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-03 finished in 418 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((p0&&(G((!p1||X(p0))) U !p2)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-28 02:30:33] [INFO ] Invariant cache hit.
[2024-05-28 02:30:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (NOT p0), (AND p1 (NOT p0)), p2]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=6 dest: 4}, { cond=p2, acceptance={0} source=6 dest: 5}, { cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s22 1), p2:(LT s122 1), p1:(GEQ s95 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-04 finished in 498 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((p0||X(p1))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:30:34] [INFO ] Invariant cache hit.
[2024-05-28 02:30:34] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2024-05-28 02:30:34] [INFO ] Invariant cache hit.
[2024-05-28 02:30:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:30:34] [INFO ] Invariant cache hit.
[2024-05-28 02:30:34] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-28 02:30:34] [INFO ] Invariant cache hit.
[2024-05-28 02:30:34] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GEQ s33 1), p1:(LT s97 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 2665 reset in 367 ms.
Stack based approach found an accepted trace after 49 steps with 2 reset with depth 32 and stack size 32 in 1 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-05 finished in 758 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)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 11 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:30:34] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 02:30:35] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 7/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-06 finished in 159 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)||!p1)) U X((p2 U p3)))||X(p1)))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:35] [INFO ] Computed 52 invariants in 4 ms
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 446 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), p3, p3, true, (OR (AND (NOT p1) p3) (AND p0 p3)), (OR (AND (NOT p1) p3) (AND p0 p3)), p0, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0 p3), acceptance={} source=6 dest: 7}, { cond=(AND p1 p3), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1)), p3:(GEQ s37 1), p2:(GEQ s63 1), p0:(GEQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-07 finished in 708 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||(F(G(p1)) U p2)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 97 place count 35 transition count 35
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 18 rules applied. Total rules applied 115 place count 35 transition count 17
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 133 place count 17 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 133 place count 17 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 13 transition count 13
Applied a total of 141 rules in 7 ms. Remains 13 /129 variables (removed 116) and now considering 13/103 (removed 90) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-05-28 02:30:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:30:35] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:30:35] [INFO ] Invariant cache hit.
[2024-05-28 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 13/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 13/129 places, 13/103 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s9 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-08 finished in 198 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)&&F(G(p1)))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 67 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 91 place count 39 transition count 37
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 15 rules applied. Total rules applied 106 place count 39 transition count 22
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 121 place count 24 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 121 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 19 transition count 17
Applied a total of 131 rules in 14 ms. Remains 19 /129 variables (removed 110) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 19 cols
[2024-05-28 02:30:36] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:30:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:30:36] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/129 places, 17/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 19/129 places, 17/103 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1) (GEQ s17 1)) (GEQ s14 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-09 finished in 269 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(F(p0))||(F(p0)&&X((G(p1)||X(p0)))))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:36] [INFO ] Computed 52 invariants in 2 ms
[2024-05-28 02:30:36] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-28 02:30:36] [INFO ] Invariant cache hit.
[2024-05-28 02:30:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-10 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 p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s111 1) (GEQ s112 1) (GEQ s114 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 587 reset in 353 ms.
Stack based approach found an accepted trace after 185 steps with 2 reset with depth 12 and stack size 12 in 3 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-10 finished in 746 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))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 9 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:30:37] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 02:30:37] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 7/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-11 finished in 182 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((p1 U p2))&&p0)))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 67 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 91 place count 39 transition count 37
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 107 place count 39 transition count 21
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 123 place count 23 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 123 place count 23 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 129 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 19 transition count 17
Applied a total of 131 rules in 15 ms. Remains 19 /129 variables (removed 110) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 19 cols
[2024-05-28 02:30:37] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-28 02:30:37] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/129 places, 17/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 19/129 places, 17/103 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s18 1)), p2:(GEQ s11 1), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-13 finished in 269 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 X(G(!p0))))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 9 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:30:37] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:30:37] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 7/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, true, p0]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-14 finished in 217 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 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:37] [INFO ] Computed 52 invariants in 1 ms
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-28 02:30:37] [INFO ] Invariant cache hit.
[2024-05-28 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s125 1) (GEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLFireability-15 finished in 339 ms.
All properties solved by simple procedures.
Total runtime 9797 ms.

BK_STOP 1716863439011

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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="RefineWMG-PT-025026"
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 RefineWMG-PT-025026, 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 r329-tall-171662362300458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025026.tgz
mv RefineWMG-PT-025026 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 ;