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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 35K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621262194959

Running Version 0
[2021-05-17 14:36:38] [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:36:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:36:38] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-17 14:36:38] [INFO ] Transformed 79 places.
[2021-05-17 14:36:38] [INFO ] Transformed 63 transitions.
[2021-05-17 14:36:38] [INFO ] Parsed PT model containing 79 places and 63 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:36:39] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-015016-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 27 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:39] [INFO ] Computed 32 place invariants in 6 ms
[2021-05-17 14:36:39] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:39] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:39] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:39] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:36:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:39] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:39] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
[2021-05-17 14:36:39] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:36:39] [INFO ] Flatten gal took : 43 ms
FORMULA RefineWMG-PT-015016-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:36:39] [INFO ] Flatten gal took : 17 ms
[2021-05-17 14:36:40] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 13837 steps, including 0 resets, run visited all 26 properties in 63 ms. (steps per millisecond=219 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((F(G(p2))&&p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:40] [INFO ] Computed 32 place invariants in 5 ms
[2021-05-17 14:36:40] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:40] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:36:40] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:40] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:41] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:41] [INFO ] Computed 32 place invariants in 27 ms
[2021-05-17 14:36:41] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015016-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s58 1) (GEQ s71 1) (GEQ s72 1) (GEQ s74 1)), p1:(AND (GEQ s71 1) (GEQ s72 1) (GEQ s74 1)), p2:(AND (GEQ s53 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 1 reset in 4 ms.
FORMULA RefineWMG-PT-015016-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-00 finished in 1344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (X(X((p2||F(p3))))&&p1)))], workingDir=/home/mcc/execution]
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:41] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:41] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:41] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-17 14:36:41] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:41] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:36:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:41] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:41] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 667 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-015016-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 7}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={0} source=10 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=10 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={0} source=11 dest: 10}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p1:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1)), p0:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1)), p2:(LT s62 1), p3:(AND (GEQ s61 1) (GEQ s62 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, 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-015016-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-01 finished in 1056 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:42] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:42] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:42] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:42] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:42] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:42] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:42] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s4 5) (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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-03 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:43] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:43] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:43] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:43] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:43] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:43] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s51 1) (GEQ s52 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 568 reset in 973 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA RefineWMG-PT-015016-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-05 finished in 1391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 6 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 21 transition count 9
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 83 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 83 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 7 transition count 7
Applied a total of 87 rules in 55 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:36:44] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:44] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 14:36:44] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:36:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2021-05-17 14:36:44] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:36:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-06 automaton TGBA [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 1 ms.
FORMULA RefineWMG-PT-015016-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-06 finished in 292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1 U ((p1&&(p2||X(!p0)))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:44] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-17 14:36:44] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:44] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:44] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:44] [INFO ] Computed 32 place invariants in 3 ms
[2021-05-17 14:36:46] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:46] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-17 14:36:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015016-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s20 1), p1:(LT s63 1), p2:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 558 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 53 in 0 ms.
FORMULA RefineWMG-PT-015016-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-07 finished in 2415 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 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 21 transition count 9
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 83 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 83 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 7 transition count 7
Applied a total of 87 rules in 4 ms. Remains 7 /79 variables (removed 72) and now considering 7/63 (removed 56) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:36:47] [INFO ] Dead Transitions using invariants and state equation in 344 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:36:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:36:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 14:36:47] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:36:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:36:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/79 places, 7/63 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 47 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-08 finished in 542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:47] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:47] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:47] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:47] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:47] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:50] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:50] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s68 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9007 reset in 296 ms.
Stack based approach found an accepted trace after 16 steps with 3 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-015016-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-09 finished in 3082 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 42 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 56 place count 23 transition count 22
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 67 place count 23 transition count 11
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 10 transition count 9
Applied a total of 82 rules in 11 ms. Remains 10 /79 variables (removed 69) and now considering 9/63 (removed 54) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:36:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:36:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:36:51] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:36:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:51] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2021-05-17 14:36:51] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:36:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:51] [INFO ] Dead Transitions using invariants and state equation in 471 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 9/63 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-015016-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} 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 173 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-10 finished in 1012 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G((!p1||G(p2)))&&X(!p3))))], workingDir=/home/mcc/execution]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:51] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:51] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:51] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:51] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 14:36:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 663 ms :[(OR p3 (AND p1 (NOT p2))), true, p3, (NOT p2), (AND (NOT p2) p1), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)), (AND p1 (NOT p2)), p3, (AND p1 (NOT p2)), (AND (NOT p2) p3), (AND (NOT p2) (NOT p1) p3)]
Running random walk in product with property : RefineWMG-PT-015016-11 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={0} source=0 dest: 6}, { cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={0, 1} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=5 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2) p0 p3), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0) p3), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND p2 (NOT p0) p3)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p2 (NOT p0) p3), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 4}, { cond=(AND p1 p2 p0 p3), acceptance={1} source=7 dest: 5}, { cond=(OR (AND (NOT p1) p0 p3) (AND p2 p0 p3)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p0 p3) (AND p2 p0 p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2) p0 p3), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0) p3), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) p3), acceptance={} source=9 dest: 2}, { cond=(AND p1 p2 (NOT p0) p3), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 4}, { cond=(AND p1 p2 p0 p3), acceptance={1} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={0, 1} source=9 dest: 7}, { cond=(AND (NOT p1) p2 p0 p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0 p3), acceptance={1} source=9 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0) p3), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=10 dest: 3}]], initial=0, aps=[p1:(LT s62 1), p2:(LT s12 1), p0:(AND (GEQ s23 1) (LT s12 1)), p3:(GEQ s23 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1970 steps with 4 reset in 7 ms.
FORMULA RefineWMG-PT-015016-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-11 finished in 980 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:52] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:52] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:52] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:52] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015016-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s13 1) (LT s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-12 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-015016-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s62 1), p1:(OR (LT s46 1) (LT s47 1) (LT s49 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 764 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-015016-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-13 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||((p1||X((p2 U p3))) U p4)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-17 14:36:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 79 cols
[2021-05-17 14:36:53] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-17 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p4) (NOT p0)), (AND (NOT p4) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-015016-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p4:(GEQ s40 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 48 reset in 340 ms.
Stack based approach found an accepted trace after 2404 steps with 0 reset with depth 2405 and stack size 2351 in 10 ms.
FORMULA RefineWMG-PT-015016-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-14 finished in 659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 54 place count 23 transition count 21
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 65 place count 23 transition count 10
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 76 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 11 transition count 9
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 80 place count 10 transition count 8
Applied a total of 80 rules in 5 ms. Remains 10 /79 variables (removed 69) and now considering 8/63 (removed 55) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:36:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:36:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:54] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:36:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:36:54] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-17 14:36:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:36:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:36:54] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/79 places, 8/63 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015016-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s5 1), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015016-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015016-15 finished in 273 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262214954

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

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