Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416100645.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-015015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 35K May 5 16:51 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-015015-00
FORMULA_NAME RefineWMG-PT-015015-01
FORMULA_NAME RefineWMG-PT-015015-02
FORMULA_NAME RefineWMG-PT-015015-03
FORMULA_NAME RefineWMG-PT-015015-04
FORMULA_NAME RefineWMG-PT-015015-05
FORMULA_NAME RefineWMG-PT-015015-06
FORMULA_NAME RefineWMG-PT-015015-07
FORMULA_NAME RefineWMG-PT-015015-08
FORMULA_NAME RefineWMG-PT-015015-09
FORMULA_NAME RefineWMG-PT-015015-10
FORMULA_NAME RefineWMG-PT-015015-11
FORMULA_NAME RefineWMG-PT-015015-12
FORMULA_NAME RefineWMG-PT-015015-13
FORMULA_NAME RefineWMG-PT-015015-14
FORMULA_NAME RefineWMG-PT-015015-15

=== Now, execution of the tool begins

BK_START 1621261847519

Running Version 0
[2021-05-17 14:30:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:30:49] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-17 14:30:49] [INFO ] Transformed 79 places.
[2021-05-17 14:30:49] [INFO ] Transformed 63 transitions.
[2021-05-17 14:30:49] [INFO ] Parsed PT model containing 79 places and 63 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:30:49] [INFO ] Initial state test concluded for 2 properties.
FORMULA RefineWMG-PT-015015-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:49] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 14:30:49] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:49] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:30:49] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:49] [INFO ] Computed 32 place invariants in 6 ms
[2021-05-17 14:30:49] [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.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:49] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 14:30:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
[2021-05-17 14:30:49] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 14:30:49] [INFO ] Flatten gal took : 36 ms
FORMULA RefineWMG-PT-015015-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:30:49] [INFO ] Flatten gal took : 9 ms
[2021-05-17 14:30:49] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 7909 steps, including 0 resets, run visited all 24 properties in 34 ms. (steps per millisecond=232 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&(G(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:50] [INFO ] Computed 32 place invariants in 25 ms
[2021-05-17 14:30:50] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:50] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 14:30:50] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:50] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:50] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:50] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015015-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s53 1), p2:(GEQ s58 1), p1:(AND (GEQ s71 1) (GEQ s72 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2239 reset in 462 ms.
Stack based approach found an accepted trace after 65 steps with 1 reset with depth 52 and stack size 52 in 1 ms.
FORMULA RefineWMG-PT-015015-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-00 finished in 1221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0&&(X(F(p1))||F(p2))))||G(p3)))], workingDir=/home/mcc/execution]
Support contains 9 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:51] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:30:51] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:30:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 14:30:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-015015-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(LT s62 1), p2:(OR (LT s61 1) (LT s62 1) (LT s64 1)), p1:(OR (LT s41 1) (LT s42 1) (LT s44 1)), p3:(OR (LT s51 1) (LT s52 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 87 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-01 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:51] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:51] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-02 automaton TGBA [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:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 757 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-015015-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-02 finished in 306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:52] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-03 finished in 339 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((G(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 3 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 58 place count 23 transition count 23
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 67 place count 23 transition count 14
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 76 place count 14 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 76 place count 14 transition count 11
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 82 place count 11 transition count 11
Applied a total of 82 rules in 21 ms. Remains 11 /79 variables (removed 68) and now considering 11/63 (removed 52) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-17 14:30:52] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/79 places, 11/63 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s7 1) (GEQ s4 5)), p2:(GEQ s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 186 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-015015-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-04 finished in 213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 58 place count 23 transition count 23
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 10 rules applied. Total rules applied 68 place count 23 transition count 13
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 78 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 11 transition count 11
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 84 place count 10 transition count 10
Applied a total of 84 rules in 9 ms. Remains 10 /79 variables (removed 69) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-17 14:30:52] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:30:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 10/63 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-07 automaton TGBA [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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s9 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 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-07 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (F(p1) U G((F(p3)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 38 edges and 79 vertex of which 24 / 79 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 54 place count 27 transition count 26
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 63 place count 27 transition count 17
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 72 place count 18 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 72 place count 18 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 16 transition count 15
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 78 place count 15 transition count 14
Applied a total of 78 rules in 7 ms. Remains 15 /79 variables (removed 64) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:30:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:30:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:30:52] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:30:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:52] [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.
[2021-05-17 14:30:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:30:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:30:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/79 places, 14/63 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-08 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(LT s14 1), p1:(OR (LT s6 1) (LT s7 1) (LT s9 1)), p3:(OR (LT s11 1) (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, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-08 finished in 286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(X(!p1))||(G(p2)&&X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 5 ms
[2021-05-17 14:30:53] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-015015-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s53 1), p1:(LT s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9158 reset in 261 ms.
Stack based approach found an accepted trace after 129 steps with 14 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-015015-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-09 finished in 546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(p1)||X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:53] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:53] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:30:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-11 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p2:(GEQ s58 1), p0:(LT s3 3), p1:(LT s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32427 reset in 185 ms.
Stack based approach found an accepted trace after 2884 steps with 957 reset with depth 11 and stack size 11 in 6 ms.
FORMULA RefineWMG-PT-015015-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-11 finished in 453 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:54] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:54] [INFO ] Computed 32 place invariants in 21 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:54] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:30:54] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-12 automaton TGBA [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 (LT s11 1) (LT s12 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 375 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-015015-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-12 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 21 transition count 9
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 83 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 83 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 85 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 87 place count 7 transition count 7
Applied a total of 87 rules in 3 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-17 14:30:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:30:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-14 finished in 98 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 53 place count 25 transition count 23
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 64 place count 25 transition count 12
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 75 place count 14 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 13 transition count 11
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 79 place count 12 transition count 10
Applied a total of 79 rules in 4 ms. Remains 12 /79 variables (removed 67) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:30:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:30:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:30:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 14:30:54] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:30:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:30:54] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/79 places, 10/63 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-015015-15 automaton TGBA [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:(AND (LT s5 1) (GEQ s0 1) (GEQ s9 1) (GEQ s10 1)), p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-15 finished in 127 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261854807

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-015015"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-015015, 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 r178-tajo-162089416100645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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