fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281572400524
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RefineWMG-PT-015015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
278.455 9140.00 19566.00 51.80 TFFFFFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400524.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 r186-tajo-165281572400524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 5.9K Apr 30 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 30 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 30 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 35K May 10 09:34 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-LTLFireability-00
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-01
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-02
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-03
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-04
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-05
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-06
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-07
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-08
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-09
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-10
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-11
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-12
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-13
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-14
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084671576

Running Version 202205111006
[2022-05-20 22:11:12] [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]
[2022-05-20 22:11:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:11:13] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2022-05-20 22:11:13] [INFO ] Transformed 79 places.
[2022-05-20 22:11:13] [INFO ] Transformed 63 transitions.
[2022-05-20 22:11:13] [INFO ] Parsed PT model containing 79 places and 63 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RefineWMG-PT-015015-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 14 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:13] [INFO ] Computed 32 place invariants in 8 ms
[2022-05-20 22:11:13] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:13] [INFO ] Computed 32 place invariants in 3 ms
[2022-05-20 22:11:13] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:13] [INFO ] Computed 32 place invariants in 3 ms
[2022-05-20 22:11:13] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:13] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:13] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Support contains 26 out of 79 places after structural reductions.
[2022-05-20 22:11:13] [INFO ] Flatten gal took : 21 ms
[2022-05-20 22:11:13] [INFO ] Flatten gal took : 9 ms
[2022-05-20 22:11:13] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=61 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :1
Running SMT prover for 9 properties.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:14] [INFO ] Computed 32 place invariants in 3 ms
[2022-05-20 22:11:14] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2022-05-20 22:11:14] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 22:11:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-20 22:11:14] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 22:11:14] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-05-20 22:11:14] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 113 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=22 )
Parikh walk visited 9 properties in 31 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:11:15] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:15] [INFO ] Computed 32 place invariants in 7 ms
[2022-05-20 22:11:15] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:15] [INFO ] Computed 32 place invariants in 17 ms
[2022-05-20 22:11:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:15] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LT s43 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-015015-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-015015-LTLFireability-00 finished in 1051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(((p1 U G(p2))&&p0)))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 2 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 27 transition count 19
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 20 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 20 transition count 16
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 74 place count 17 transition count 16
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 76 place count 16 transition count 15
Applied a total of 76 rules in 10 ms. Remains 16 /79 variables (removed 63) and now considering 15/63 (removed 48) transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:11:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:11:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:11:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-20 22:11:16] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2022-05-20 22:11:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/79 places, 15/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/79 places, 15/63 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1) (LT s12 1)), p2:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-01 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 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 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 56 place count 23 transition count 22
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 66 place count 23 transition count 12
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 76 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 13 transition count 10
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 80 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 10 transition count 9
Applied a total of 82 rules in 14 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:16] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-20 22:11:16] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 9/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 9/63 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s5 1), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-015015-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-02 finished in 162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)&&G(p2)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:11:16] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:16] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:16] [INFO ] Computed 32 place invariants in 2 ms
[2022-05-20 22:11:16] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:16] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:16] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GEQ s72 1), p1:(GEQ s18 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1378 steps with 0 reset in 28 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-03 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(F(p1)))&&G(F(p2)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 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 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 56 place count 23 transition count 22
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 67 place count 23 transition count 11
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 place count 12 transition count 11
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 12 transition count 9
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 10 transition count 9
Applied a total of 82 rules in 7 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-20 22:11:17] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 9/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 9/63 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s8 1), p2:(OR (LT s8 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-04 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:11:17] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:17] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:17] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:17] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s67 1), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2405 steps with 0 reset in 11 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-05 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 6 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-20 22:11:17] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:11:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/79 places, 7/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-08 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-015015-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-08 finished in 154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(p0))||p1))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 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 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 56 place count 23 transition count 22
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 67 place count 23 transition count 11
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 10 transition count 9
Applied a total of 82 rules in 7 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 22:11:18] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 9/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 9/63 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8 1), p1:(GEQ s5 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 188 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-09 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p0)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-015015-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-10 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p0)&&F(G(X(p1)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 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 69 place count 23 transition count 12
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 80 place count 12 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 80 place count 12 transition count 11
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 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 5 ms. Remains 10 /79 variables (removed 69) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-20 22:11:18] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:11:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 10/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 10/63 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=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:(LT s8 1), p1:(GEQ s6 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-015015-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-11 finished in 220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((F(p0)||p1)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 4 ms
[2022-05-20 22:11:18] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:18] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s20 1) (GEQ s55 1)), p1:(GEQ s65 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][false, false, false]]
Product exploration explored 100000 steps with 929 reset in 291 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-12 finished in 696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!G(X(p0)) U ((p2 U X(p3))&&p1))))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:19] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 22:11:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:19] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:19] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:19] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2022-05-20 22:11:19] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-20 22:11:19] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p3)), p0, (OR (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p2:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1)), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p3:(AND (GEQ s11 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28590 reset in 326 ms.
Stack based approach found an accepted trace after 312 steps with 96 reset with depth 4 and stack size 4 in 3 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-13 finished in 942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 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 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 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 7 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:11:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:11:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:11:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 22:11:20] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:11:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:11:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/79 places, 7/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-15 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-015015-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-15 finished in 189 ms.
All properties solved by simple procedures.
Total runtime 7575 ms.

BK_STOP 1653084680716

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r186-tajo-165281572400524"
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 ;