Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-025025-00
FORMULA_NAME RefineWMG-PT-025025-01
FORMULA_NAME RefineWMG-PT-025025-02
FORMULA_NAME RefineWMG-PT-025025-03
FORMULA_NAME RefineWMG-PT-025025-04
FORMULA_NAME RefineWMG-PT-025025-05
FORMULA_NAME RefineWMG-PT-025025-06
FORMULA_NAME RefineWMG-PT-025025-07
FORMULA_NAME RefineWMG-PT-025025-08
FORMULA_NAME RefineWMG-PT-025025-09
FORMULA_NAME RefineWMG-PT-025025-10
FORMULA_NAME RefineWMG-PT-025025-11
FORMULA_NAME RefineWMG-PT-025025-12
FORMULA_NAME RefineWMG-PT-025025-13
FORMULA_NAME RefineWMG-PT-025025-14
FORMULA_NAME RefineWMG-PT-025025-15

=== Now, execution of the tool begins

BK_START 1621262741374

Running Version 0
[2021-05-17 14:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:45:43] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-17 14:45:43] [INFO ] Transformed 129 places.
[2021-05-17 14:45:43] [INFO ] Transformed 103 transitions.
[2021-05-17 14:45:43] [INFO ] Parsed PT model containing 129 places and 103 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:45:43] [INFO ] Initial state test concluded for 2 properties.
FORMULA RefineWMG-PT-025025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:43] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:43] [INFO ] Computed 52 place invariants in 8 ms
[2021-05-17 14:45:43] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:43] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-17 14:45:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:43] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-17 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
[2021-05-17 14:45:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:45:43] [INFO ] Flatten gal took : 32 ms
FORMULA RefineWMG-PT-025025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:45:43] [INFO ] Flatten gal took : 11 ms
[2021-05-17 14:45:43] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 100013 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=730 ) properties (out of 30) seen :28
Running SMT prover for 2 properties.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:43] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:45:44] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2021-05-17 14:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:44] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 14:45:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:45:44] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:45:44] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 14:45:44] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 14:45:44] [INFO ] Added : 51 causal constraints over 11 iterations in 119 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((p0&&G(p1))||F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:44] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:44] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:44] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:44] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:44] [INFO ] Computed 52 place invariants in 8 ms
[2021-05-17 14:45:44] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:44] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-025025-00 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LT s7 1), p1:(LT s47 1), p2:(AND (LT s73 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Stack based approach found an accepted trace after 218 steps with 0 reset with depth 219 and stack size 218 in 2 ms.
FORMULA RefineWMG-PT-025025-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-00 finished in 995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 24 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:45:45] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:45:45] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:45:45] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 14:45:45] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:45:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-01 finished in 119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0||F(p1)))&&(p0||X(X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:45] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:45] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:45] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:45] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(AND (GEQ s91 1) (GEQ s92 1) (GEQ s94 1)), p0:(GEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-02 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:45] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LT s92 1), p1:(LT s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 217 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-025025-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-03 finished in 387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 112 place count 37 transition count 15
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 132 place count 17 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 132 place count 17 transition count 14
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 134 place count 16 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 15 transition count 13
Applied a total of 136 rules in 7 ms. Remains 15 /129 variables (removed 114) and now considering 13/103 (removed 90) transitions.
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:45:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:45:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:45:46] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:45:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:45:46] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/129 places, 13/103 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(OR (LT s0 1) (LT s12 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-04 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1&&(F(p2) U p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 114 place count 35 transition count 15
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 133 place count 16 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 133 place count 16 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 13 transition count 12
Applied a total of 139 rules in 4 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-17 14:45:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-025025-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s5 1) (LT s8 1)), p1:(GEQ s12 1), p3:(GEQ s4 5), p2:(AND (GEQ s4 5) (GEQ s3 3))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-05 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 93 place count 35 transition count 33
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 112 place count 35 transition count 14
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 131 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 16 transition count 12
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 135 place count 14 transition count 12
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 137 place count 13 transition count 11
Applied a total of 137 rules in 5 ms. Remains 13 /129 variables (removed 116) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 14:45:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s7 1) (LT s9 1)), p1:(LT s11 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 6 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-07 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((X(p0)&&(p1||X(F(p2))))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:46] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:46] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:47] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s120 1), p0:(LT s58 1), p2:(AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 44 reset in 1 ms.
FORMULA RefineWMG-PT-025025-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-08 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G((p0||X(!p1))))||F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:47] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:47] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:47] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:47] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:47] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:47] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s53 1), p0:(GEQ s127 1), p1:(LT s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 76 reset in 456 ms.
Product exploration explored 100000 steps with 1789 reset in 512 ms.
Knowledge obtained : [(NOT p2), p0, p1]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1), (NOT p2)]
Product exploration explored 100000 steps with 270 reset in 368 ms.
Product exploration explored 100000 steps with 1435 reset in 473 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1), (NOT p2)]
Support contains 3 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 47 place count 83 transition count 58
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 47 rules in 11 ms. Remains 83 /129 variables (removed 46) and now considering 58/103 (removed 45) transitions.
// Phase 1: matrix 58 rows 83 cols
[2021-05-17 14:45:50] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
[2021-05-17 14:45:50] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 58 rows 83 cols
[2021-05-17 14:45:50] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/129 places, 58/103 transitions.
Stuttering criterion allowed to conclude after 76221 steps with 712 reset in 342 ms.
FORMULA RefineWMG-PT-025025-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-10 finished in 3399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 7 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:45:50] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:50] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:45:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2021-05-17 14:45:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:45:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/129 places, 7/103 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, p0]
Running random walk in product with property : RefineWMG-PT-025025-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT 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 86 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-025025-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-11 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((X(G(p1))&&p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-025025-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s92 1) (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p1:(GEQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-12 finished in 474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:45:51] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-025025-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1)), p1:(LT s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-13 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0||G(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:51] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:52] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:52] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:45:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:45:52] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:45:52] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s52 1), p1:(GEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 351 ms.
Product exploration explored 100000 steps with 25000 reset in 329 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 232 ms.
Product exploration explored 100000 steps with 25000 reset in 271 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 81 transition count 56
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 48 rules in 7 ms. Remains 81 /129 variables (removed 48) and now considering 56/103 (removed 47) transitions.
// Phase 1: matrix 56 rows 81 cols
[2021-05-17 14:45:54] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-17 14:45:54] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
[2021-05-17 14:45:54] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 56 rows 81 cols
[2021-05-17 14:45:54] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-17 14:45:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/129 places, 56/103 transitions.
Product exploration explored 100000 steps with 25000 reset in 390 ms.
Product exploration explored 100000 steps with 25000 reset in 400 ms.
[2021-05-17 14:45:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:45:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 14:45:55] [INFO ] Time to serialize gal into /tmp/LTL15363604217127101893.gal : 3 ms
[2021-05-17 14:45:55] [INFO ] Time to serialize properties into /tmp/LTL2364937033958759391.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15363604217127101893.gal, -t, CGAL, -LTL, /tmp/LTL2364937033958759391.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15363604217127101893.gal -t CGAL -LTL /tmp/LTL2364937033958759391.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(p49>=1)")||(G(F("(p22>=1)")))))))))
Formula 0 simplified : !XXXF("(p49>=1)" | GF"(p22>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
805 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.09757,165404,1,0,8,763099,21,0,5328,1.02146e+06,16
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-025025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-025025-14 finished in 11648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((X(p1)&&p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:46:03] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:46:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:46:03] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:46:03] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:46:03] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:46:03] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:46:03] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:46:03] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s22 1) (OR (LT s91 1) (LT s92 1) (LT s94 1))), p1:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 469 ms.
Stack based approach found an accepted trace after 1377 steps with 0 reset with depth 1378 and stack size 1356 in 6 ms.
FORMULA RefineWMG-PT-025025-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-15 finished in 860 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262764638

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-025025"
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-025025, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416100661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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