Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772500804.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D30N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772500804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 8.3K Apr 30 04:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 04:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 04:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 04:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:33 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 Diffusion2D-PT-D30N150-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D30N150-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652657008765

Running Version 202205111006
[2022-05-15 23:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:23:30] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2022-05-15 23:23:30] [INFO ] Transformed 900 places.
[2022-05-15 23:23:30] [INFO ] Transformed 6844 transitions.
[2022-05-15 23:23:30] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 168 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:30] [INFO ] Computed 1 place invariants in 69 ms
[2022-05-15 23:23:31] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:31] [INFO ] Computed 1 place invariants in 36 ms
[2022-05-15 23:23:31] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:32] [INFO ] Computed 1 place invariants in 34 ms
[2022-05-15 23:23:33] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Support contains 35 out of 900 places after structural reductions.
[2022-05-15 23:23:34] [INFO ] Flatten gal took : 304 ms
[2022-05-15 23:23:34] [INFO ] Flatten gal took : 180 ms
[2022-05-15 23:23:34] [INFO ] Input system was already deterministic with 6844 transitions.
Support contains 34 out of 900 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10122 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=198 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:35] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:23:35] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-15 23:23:41] [INFO ] After 4932ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:27
[2022-05-15 23:23:41] [INFO ] After 5424ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:29
[2022-05-15 23:23:41] [INFO ] After 6471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2022-05-15 23:23:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 23:23:47] [INFO ] After 4713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2022-05-15 23:23:53] [INFO ] After 10739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 3511 ms.
[2022-05-15 23:23:56] [INFO ] After 15171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 29 Parikh solutions to 8 different solutions.
Finished Parikh walk after 17239 steps, including 0 resets, run visited all 29 properties in 675 ms. (steps per millisecond=25 )
Parikh walk visited 29 properties in 683 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(p1)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 104 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:58] [INFO ] Computed 1 place invariants in 31 ms
[2022-05-15 23:23:58] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:58] [INFO ] Computed 1 place invariants in 32 ms
[2022-05-15 23:23:59] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:23:59] [INFO ] Computed 1 place invariants in 30 ms
[2022-05-15 23:24:00] [INFO ] Dead Transitions using invariants and state equation in 1909 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s841 1), p1:(LT s466 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 951 ms.
Product exploration explored 100000 steps with 50000 reset in 768 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-00 finished in 5314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U G(!F(p1)))&&F(p2))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 65 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:03] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 23:24:03] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:03] [INFO ] Computed 1 place invariants in 25 ms
[2022-05-15 23:24:04] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:04] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:06] [INFO ] Dead Transitions using invariants and state equation in 2114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p0), (NOT p2), p1]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s528 1), p0:(GEQ s30 1), p2:(GEQ s789 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24 reset in 2320 ms.
Stack based approach found an accepted trace after 3917 steps with 1 reset with depth 34 and stack size 34 in 75 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-01 finished in 5650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||G(F(p1))))||G(p2)))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 84 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:09] [INFO ] Computed 1 place invariants in 30 ms
[2022-05-15 23:24:09] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:09] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:24:09] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:09] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:24:11] [INFO ] Dead Transitions using invariants and state equation in 2043 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s770 1), p0:(OR (GEQ s492 1) (GEQ s837 1)), p1:(GEQ s837 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 2059 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-02 finished in 5352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 59 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:14] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:14] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:14] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:24:15] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:15] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:24:17] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s748 1), p1:(LT s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-03 finished in 3153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(((X(X(p0)) U p0)||X(p0)) U p1)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 58 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:17] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:24:17] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:17] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:18] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:18] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:24:20] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, p0]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 0}]], initial=1, aps=[p1:(LT s282 1), p0:(GEQ s355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-04 finished in 3204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(X(F(p1)))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 70 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:20] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:24:20] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:20] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 23:24:21] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:21] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 23:24:23] [INFO ] Dead Transitions using invariants and state equation in 1983 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s836 1) (GEQ s784 1)), p1:(GEQ s836 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-05 finished in 3287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)&&G(p1)))||!p0)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 71 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:24] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:24:24] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:24] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 23:24:24] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:24] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 23:24:26] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s848 1), p1:(OR (AND (LT s848 1) (GEQ s323 1)) (GEQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 4551 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-06 finished in 7601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(p1))&&p0))||G(p1)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 61 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:31] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:31] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:31] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:32] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:32] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 23:24:34] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(OR p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s451 1), p0:(AND (LT s97 1) (LT s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 201 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-07 finished in 3049 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6812 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 11 ms
Free SCC test removed 897 places
Ensure Unique test removed 6839 transitions
Reduce isomorphic transitions removed 6839 transitions.
Applied a total of 1 rules in 22 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:34] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 23:24:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (LT s1 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 Diffusion2D-PT-D30N150-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-09 finished in 158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(F(p0))))))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 64 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:34] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:24:34] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:34] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:24:35] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:35] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 23:24:37] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s319 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 3715 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 2 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-10 finished in 6714 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0) U p1))))'
Support contains 1 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 62 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:41] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:24:41] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:41] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:24:42] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:42] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:24:44] [INFO ] Dead Transitions using invariants and state equation in 2229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s636 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Product exploration explored 100000 steps with 50000 reset in 566 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-11 finished in 4422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(G(G(p0)))||p1)))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6812 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 12 ms
Free SCC test removed 897 places
Ensure Unique test removed 6839 transitions
Reduce isomorphic transitions removed 6839 transitions.
Applied a total of 1 rules in 21 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:45] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-15 23:24:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 23:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:24:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s0 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 8 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-12 finished in 158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(!X(X(p1))&&F(p1))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 56 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:46] [INFO ] Computed 1 place invariants in 25 ms
[2022-05-15 23:24:46] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:46] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 23:24:46] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:46] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:24:48] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 416 ms :[false, false, false, (AND (NOT p1) (NOT p0)), false, (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=true, acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p1:(GEQ s881 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20076 reset in 553 ms.
Product exploration explored 100000 steps with 19971 reset in 465 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 11 states, 17 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Incomplete random walk after 10105 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 200511 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200511 steps, saw 159627 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:54] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:24:54] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-15 23:24:54] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 23:24:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-05-15 23:24:56] [INFO ] After 1657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 23:24:56] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 481 ms.
[2022-05-15 23:24:57] [INFO ] After 3222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 9663 steps, including 0 resets, run visited all 4 properties in 228 ms. (steps per millisecond=42 )
Parikh walk visited 4 properties in 229 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 63 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:58] [INFO ] Computed 1 place invariants in 34 ms
[2022-05-15 23:24:58] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:58] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:24:59] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:24:59] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:25:01] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Incomplete random walk after 10119 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1686 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 202179 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202179 steps, saw 160780 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:25:04] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:25:05] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-15 23:25:05] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 23:25:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-05-15 23:25:06] [INFO ] After 1584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 23:25:07] [INFO ] After 2405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 468 ms.
[2022-05-15 23:25:08] [INFO ] After 3064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 9189 steps, including 0 resets, run visited all 4 properties in 205 ms. (steps per millisecond=44 )
Parikh walk visited 4 properties in 208 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 7 states, 12 edges and 2 AP to 7 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) p1), false, false, false, false, false]
Product exploration explored 100000 steps with 41 reset in 1570 ms.
Stack based approach found an accepted trace after 574 steps with 0 reset with depth 575 and stack size 571 in 5 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-13 finished in 24834 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!G((p0 U p1))) U (F(p2) U p3))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6786 edges and 900 vertex of which 896 / 900 are part of one of the 1 SCC in 5 ms
Free SCC test removed 895 places
Ensure Unique test removed 6835 transitions
Reduce isomorphic transitions removed 6835 transitions.
Applied a total of 1 rules in 12 ms. Remains 5 /900 variables (removed 895) and now considering 9/6844 (removed 6835) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:25:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:25:10] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:25:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:25:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-15 23:25:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:25:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:25:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/900 places, 9/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/900 places, 9/6844 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p3), (AND p1 (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s3 1), p2:(GEQ s2 1), p1:(GEQ s1 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-14 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(p1))||p0))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 56 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:25:11] [INFO ] Computed 1 place invariants in 25 ms
[2022-05-15 23:25:11] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:25:11] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 23:25:12] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:25:12] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:25:14] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s271 1) (GEQ s608 1)), p1:(GEQ s807 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32 reset in 1760 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLFireability-15 finished in 4817 ms.
All properties solved by simple procedures.
Total runtime 106098 ms.

BK_STOP 1652657116101

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D30N150"
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 Diffusion2D-PT-D30N150, 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 r060-tall-165254772500804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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