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-165281572500580.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-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572500580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 02:22 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.8K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 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 218K 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-100101-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100101-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653087242170

Running Version 202205111006
[2022-05-20 22:54:03] [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:54:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:54:03] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-05-20 22:54:03] [INFO ] Transformed 504 places.
[2022-05-20 22:54:03] [INFO ] Transformed 403 transitions.
[2022-05-20 22:54:03] [INFO ] Parsed PT model containing 504 places and 403 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-100101-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 92 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:04] [INFO ] Computed 202 place invariants in 18 ms
[2022-05-20 22:54:04] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:04] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:54:05] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:05] [INFO ] Computed 202 place invariants in 46 ms
[2022-05-20 22:54:05] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:05] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:54:06] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Support contains 54 out of 504 places after structural reductions.
[2022-05-20 22:54:06] [INFO ] Flatten gal took : 116 ms
[2022-05-20 22:54:06] [INFO ] Flatten gal took : 68 ms
[2022-05-20 22:54:06] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:07] [INFO ] Computed 202 place invariants in 6 ms
[2022-05-20 22:54:07] [INFO ] [Real]Absence check using 202 positive place invariants in 38 ms returned sat
[2022-05-20 22:54:08] [INFO ] After 930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-20 22:54:08] [INFO ] [Nat]Absence check using 202 positive place invariants in 49 ms returned sat
[2022-05-20 22:54:09] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-20 22:54:10] [INFO ] After 1547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 484 ms.
[2022-05-20 22:54:10] [INFO ] After 2485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Finished Parikh walk after 26694 steps, including 1 resets, run visited all 1 properties in 291 ms. (steps per millisecond=91 )
Parikh walk visited 19 properties in 1181 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' '!(F(G(p0)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 5 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 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 588 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 590 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 592 place count 10 transition count 9
Applied a total of 592 rules in 73 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:54:12] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:12] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:12] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-20 22:54:12] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:12] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-00 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G((p1||G(p2)))))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 42 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:13] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:54:13] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:13] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:54:14] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:14] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:16] [INFO ] Implicit Places using invariants and state equation in 2392 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:16] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:16] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s182 1), p1:(LT s40 1), p2:(OR (LT s86 1) (LT s87 1) (LT s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1942 ms.
Entered a terminal (fully accepting) state of product in 17980 steps with 0 reset in 343 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-02 finished in 6422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 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 593 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 595 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 597 place count 7 transition count 7
Applied a total of 597 rules in 39 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:54:19] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:54:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-20 22:54:19] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-03 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-100101-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-03 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 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 593 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 595 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 597 place count 7 transition count 7
Applied a total of 597 rules in 13 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-20 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:54:19] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:54:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-20 22:54:19] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:54:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-04 automaton TGBA Formula[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 s5 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-100101-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-04 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((G(F(X(p0)))||p1)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 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 588 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 592 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 594 place count 10 transition count 10
Applied a total of 594 rules in 16 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:54:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:20] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2022-05-20 22:54:20] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:54:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s8 1), p0:(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 1358 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-05 finished in 566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((G(p0)&&(!(G(p1) U p2)||G(p3)))))))'
Support contains 6 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 391 place count 114 transition count 112
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 1 with 90 rules applied. Total rules applied 481 place count 114 transition count 22
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 571 place count 24 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 571 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 579 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 581 place count 19 transition count 17
Applied a total of 581 rules in 14 ms. Remains 19 /504 variables (removed 485) and now considering 17/403 (removed 386) transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:54:20] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:54:20] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:20] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:54:20] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-20 22:54:20] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:54:20] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:54:21] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/504 places, 17/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/504 places, 17/403 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p0) p1 p2) (AND p1 p2 (NOT p3))), (AND p1 p2 (NOT p3)), (OR (AND p1 p2 (NOT p3)) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p2)) (AND p0 p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p2 (NOT p3))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p2 p3), acceptance={0, 2} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND p2 p3)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2) p3), acceptance={1} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p2) (NOT p3))), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=2 dest: 3}, { cond=(AND p1 p0 p2 p3), acceptance={0, 1} source=2 dest: 4}, { cond=(OR (AND p1 (NOT p0) p2) (AND p1 p2 (NOT p3))), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(AND p1 p0 p2 p3), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={2} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p1 p2 p3), acceptance={0, 2} source=3 dest: 5}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=4 dest: 3}, { cond=(OR (AND p1 p0 (NOT p2)) (AND p1 p0 p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p1 p2 (NOT p3))), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p1 p0 p2 p3), acceptance={0, 2} source=4 dest: 5}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p0) (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 p2 p3)), acceptance={0, 2} source=5 dest: 5}]], initial=0, aps=[p0:(LT s6 1), p2:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p3:(LT s17 1), p1:(LT s14 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-06 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(G((G(F(p1))&&G(p0)&&F(p2))))))'
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 1 with 291 rules applied. Total rules applied 389 place count 114 transition count 111
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 482 place count 114 transition count 18
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 575 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 575 place count 21 transition count 16
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 579 place count 19 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 581 place count 18 transition count 15
Applied a total of 581 rules in 23 ms. Remains 18 /504 variables (removed 486) and now considering 15/403 (removed 388) transitions.
// Phase 1: matrix 15 rows 18 cols
[2022-05-20 22:54:21] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:21] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 15 rows 18 cols
[2022-05-20 22:54:21] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:21] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2022-05-20 22:54:21] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:54:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-20 22:54:21] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2022-05-20 22:54:21] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:54:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/504 places, 15/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/504 places, 15/403 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (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=[p0:(GEQ s10 1), p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p2:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s17 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-100101-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-08 finished in 441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((X(G(p0))||G(p1)) U !p0)))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 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 588 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 592 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 594 place count 10 transition count 10
Applied a total of 594 rules in 13 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:22] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:22] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:22] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2022-05-20 22:54:22] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s8 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-09 finished in 781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(F(p0))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 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 588 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 590 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 592 place count 10 transition count 9
Applied a total of 592 rules in 12 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:22] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:54:23] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2022-05-20 22:54:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:54:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:54:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-10 automaton TGBA Formula[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:(OR (LT s6 1) (LT s7 1) (LT s9 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 16 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-10 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(F(p0)&&(p1 U X(p2)))) U X(X(p3))))'
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:23] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:23] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:23] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:23] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:23] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:24] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:24] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:24] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 739 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p0 (NOT p3) p2), (AND p0 p2 (NOT p3)), (AND (NOT p3) p2), (AND p2 (NOT p3)), true, p0, p2, p2, (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={} source=6 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 7}, { cond=(NOT p0), acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={} source=9 dest: 7}], [{ cond=true, acceptance={} source=10 dest: 9}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=p0, acceptance={} source=11 dest: 9}, { cond=(AND p0 p1), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}, { cond=(NOT p0), acceptance={} source=11 dest: 12}], [{ cond=(AND p0 p2), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 8}]], initial=0, aps=[p0:(GEQ s285 1), p1:(GEQ s308 1), p3:(OR (GEQ s452 1) (GEQ s140 1)), p2:(AND (GEQ s46 1) (GEQ s47 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 979 ms.
Product exploration explored 100000 steps with 33333 reset in 953 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 12 factoid took 472 ms. Reduced automaton from 13 states, 32 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-100101-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLFireability-11 finished in 4922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U (F(p0)||X(p2)||(G(p3) U p1))))'
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:28] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:28] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:28] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:28] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:28] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:28] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:28] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:54:29] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p3), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s411 1) (GEQ s412 1) (GEQ s414 1)), p3:(GEQ s308 1), p1:(AND (GEQ s171 1) (GEQ s172 1) (GEQ s174 1)), p2:(GEQ s397 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 728 ms.
Product exploration explored 100000 steps with 50000 reset in 791 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) p3))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-100101-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLFireability-12 finished in 3359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p1)||X(p2)||p0))))'
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:31] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:32] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:32] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:32] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:32] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s350 1), p2:(OR (LT s341 1) (LT s342 1) (LT s344 1)), p0:(OR (LT s301 1) (LT s302 1) (LT s304 1) (LT s445 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1792 ms.
Product exploration explored 100000 steps with 0 reset in 1643 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73277 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73277 steps, saw 71496 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:40] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:40] [INFO ] [Real]Absence check using 202 positive place invariants in 35 ms returned sat
[2022-05-20 22:54:40] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 22:54:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2022-05-20 22:54:40] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 22:54:41] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-20 22:54:41] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 5675 steps, including 0 resets, run visited all 4 properties in 84 ms. (steps per millisecond=67 )
Parikh walk visited 4 properties in 83 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (AND p1 p0) (AND p2 p0)))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))]
Knowledge based reduction with 6 factoid took 440 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:42] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:54:42] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:42] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:42] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:42] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:54:43] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:43] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:43] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 83144 steps, run timeout after 3006 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83144 steps, saw 81082 distinct states, run finished after 3007 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:47] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:54:47] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2022-05-20 22:54:47] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 22:54:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2022-05-20 22:54:48] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 22:54:48] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-05-20 22:54:48] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 1638 steps, including 0 resets, run visited all 4 properties in 50 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 51 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 462 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1741 ms.
Product exploration explored 100000 steps with 0 reset in 1859 ms.
Built C files in :
/tmp/ltsmin1562601676073939168
[2022-05-20 22:54:53] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1562601676073939168
Running compilation step : cd /tmp/ltsmin1562601676073939168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 710 ms.
Running link step : cd /tmp/ltsmin1562601676073939168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin1562601676073939168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14565547561873254677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 28 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:55:08] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:55:08] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:55:08] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:55:08] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:55:08] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:55:09] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:55:09] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin17957769061970790931
[2022-05-20 22:55:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17957769061970790931
Running compilation step : cd /tmp/ltsmin17957769061970790931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 515 ms.
Running link step : cd /tmp/ltsmin17957769061970790931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin17957769061970790931;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8532526770358700970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 22:55:24] [INFO ] Flatten gal took : 31 ms
[2022-05-20 22:55:24] [INFO ] Flatten gal took : 27 ms
[2022-05-20 22:55:24] [INFO ] Time to serialize gal into /tmp/LTL9787527919769378893.gal : 6 ms
[2022-05-20 22:55:24] [INFO ] Time to serialize properties into /tmp/LTL1171903181374019803.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9787527919769378893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1171903181374019803.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9787527...266
Read 1 LTL properties
Checking formula 0 : !((G(X((((X("(p347<1)"))||(X("(((p338<1)||(p339<1))||(p341<1))")))||("((p298<1)||(p299<1))"))||("((p301<1)||(p442<1))")))))
Formula 0 simplified : !GX("((p298<1)||(p299<1))" | "((p301<1)||(p442<1))" | X"(p347<1)" | X"(((p338<1)||(p339<1))||(p341<1))")
Detected timeout of ITS tools.
[2022-05-20 22:55:39] [INFO ] Flatten gal took : 42 ms
[2022-05-20 22:55:39] [INFO ] Applying decomposition
[2022-05-20 22:55:39] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4155184058054968691.txt' '-o' '/tmp/graph4155184058054968691.bin' '-w' '/tmp/graph4155184058054968691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4155184058054968691.bin' '-l' '-1' '-v' '-w' '/tmp/graph4155184058054968691.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:55:40] [INFO ] Decomposing Gal with order
[2022-05-20 22:55:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:55:40] [INFO ] Flatten gal took : 86 ms
[2022-05-20 22:55:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 22:55:40] [INFO ] Time to serialize gal into /tmp/LTL11610391287557304220.gal : 9 ms
[2022-05-20 22:55:40] [INFO ] Time to serialize properties into /tmp/LTL15556595941059008337.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11610391287557304220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15556595941059008337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1161039...247
Read 1 LTL properties
Checking formula 0 : !((G(X((((X("(i26.u168.p347<1)"))||(X("(((i25.u163.p338<1)||(i25.u164.p339<1))||(i25.u162.p341<1))")))||("((i22.u144.p298<1)||(i22.u14...216
Formula 0 simplified : !GX("((i22.u144.p298<1)||(i22.u145.p299<1))" | "((i23.u143.p301<1)||(i33.u214.p442<1))" | X"(i26.u168.p347<1)" | X"(((i25.u163.p338<...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13480988346343455364
[2022-05-20 22:55:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13480988346343455364
Running compilation step : cd /tmp/ltsmin13480988346343455364;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 784 ms.
Running link step : cd /tmp/ltsmin13480988346343455364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13480988346343455364;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((X((LTLAPp1==true))||X((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100101-LTLFireability-13 finished in 98979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||G(p0))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 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 588 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 592 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 594 place count 10 transition count 10
Applied a total of 594 rules in 15 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:56:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:56:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:56:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:56:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:56:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-20 22:56:10] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:56:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s8 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 953 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-14 finished in 267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:56:10] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:56:11] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:56:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:56:11] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:56:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:56:11] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:56:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:56:12] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s411 1) (GEQ s412 1) (GEQ s414 1)), p0:(LT s453 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 4347 reset in 1354 ms.
Stack based approach found an accepted trace after 858 steps with 275 reset with depth 17 and stack size 17 in 8 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-15 finished in 2709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p1)||X(p2)||p0))))'
Found a SL insensitive property : RefineWMG-PT-100101-LTLFireability-13
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 1 with 288 rules applied. Total rules applied 386 place count 116 transition count 112
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 1 with 90 rules applied. Total rules applied 476 place count 116 transition count 22
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 566 place count 26 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 566 place count 26 transition count 19
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 572 place count 23 transition count 19
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 574 place count 22 transition count 18
Applied a total of 574 rules in 12 ms. Remains 22 /504 variables (removed 482) and now considering 18/403 (removed 385) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 22:56:13] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:56:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 22:56:13] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:56:13] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 22:56:13] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 22:56:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 22:56:13] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 22:56:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 22/504 places, 18/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/504 places, 18/403 transitions.
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s17 1), p2:(OR (LT s12 1) (LT s13 1) (LT s15 1)), p0:(OR (LT s6 1) (LT s7 1) (LT s9 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
Treatment of property RefineWMG-PT-100101-LTLFireability-13 finished in 392 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-13 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 22:56:13] [INFO ] Flatten gal took : 23 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 130297 ms.

BK_STOP 1653087374136

--------------------
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-100101"
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-100101, 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-165281572500580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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