Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 04:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 04:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 04:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 04:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:22 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-D30N050-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D30N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678343612429

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 06:33:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 06:33:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:33:36] [INFO ] Load time of PNML (sax parser for PT used): 495 ms
[2023-03-09 06:33:36] [INFO ] Transformed 900 places.
[2023-03-09 06:33:36] [INFO ] Transformed 6844 transitions.
[2023-03-09 06:33:36] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 650 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 339 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 06:33:37] [INFO ] Computed 1 place invariants in 100 ms
[2023-03-09 06:33:37] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-09 06:33:37] [INFO ] Invariant cache hit.
[2023-03-09 06:33:39] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2023-03-09 06:33:39] [INFO ] Invariant cache hit.
[2023-03-09 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 4152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7169 ms. Remains : 900/900 places, 6844/6844 transitions.
Support contains 30 out of 900 places after structural reductions.
[2023-03-09 06:33:44] [INFO ] Flatten gal took : 569 ms
[2023-03-09 06:33:44] [INFO ] Flatten gal took : 229 ms
[2023-03-09 06:33:45] [INFO ] Input system was already deterministic with 6844 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-09 06:33:45] [INFO ] Invariant cache hit.
[2023-03-09 06:33:46] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-09 06:33:50] [INFO ] After 2617ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-09 06:33:50] [INFO ] After 3020ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:20
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-09 06:33:50] [INFO ] After 4790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 06:33:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:33:59] [INFO ] After 7011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-09 06:34:06] [INFO ] After 14475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3942 ms.
[2023-03-09 06:34:10] [INFO ] After 19763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 6 different solutions.
Finished Parikh walk after 15580 steps, including 0 resets, run visited all 21 properties in 702 ms. (steps per millisecond=22 )
Parikh walk visited 21 properties in 712 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
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 283 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
[2023-03-09 06:34:12] [INFO ] Invariant cache hit.
[2023-03-09 06:34:12] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-09 06:34:12] [INFO ] Invariant cache hit.
[2023-03-09 06:34:13] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2023-03-09 06:34:13] [INFO ] Invariant cache hit.
[2023-03-09 06:34:17] [INFO ] Dead Transitions using invariants and state equation in 4366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6087 ms. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s841 1) (LT s391 1)), p1:(GEQ s761 1)], nbAcceptance=0, 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 95 reset in 1894 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 5 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-00 finished in 8392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(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 106 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
[2023-03-09 06:34:20] [INFO ] Invariant cache hit.
[2023-03-09 06:34:20] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-09 06:34:20] [INFO ] Invariant cache hit.
[2023-03-09 06:34:21] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2023-03-09 06:34:21] [INFO ] Invariant cache hit.
[2023-03-09 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 5678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7123 ms. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s504 1), p1:(GEQ s17 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-03 finished in 7320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&G((F(p1)&&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 24 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 59 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-09 06:34:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:34:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 06:34:27] [INFO ] Invariant cache hit.
[2023-03-09 06:34:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-09 06:34:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:27] [INFO ] Invariant cache hit.
[2023-03-09 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { 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}]], 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, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-04 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(!p0)&&(p1 U p2))))'
Support contains 3 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 6796 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 15 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 41 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-09 06:34:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 06:34:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 06:34:27] [INFO ] Invariant cache hit.
[2023-03-09 06:34:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-09 06:34:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:27] [INFO ] Invariant cache hit.
[2023-03-09 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/900 places, 7/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 4/900 places, 7/6844 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) p0), (NOT p0), (NOT p2), p0]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s1 1), p1:(GEQ s0 1), p0:(LT s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-05 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&X(F((p1&&X(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 101 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 06:34:28] [INFO ] Computed 1 place invariants in 33 ms
[2023-03-09 06:34:28] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-09 06:34:28] [INFO ] Invariant cache hit.
[2023-03-09 06:34:29] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2023-03-09 06:34:29] [INFO ] Invariant cache hit.
[2023-03-09 06:34:34] [INFO ] Dead Transitions using invariants and state equation in 4783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6306 ms. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-06 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 p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(GEQ s742 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 2539 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 2 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-06 finished in 9135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p0)&&F(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 SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6818 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 17 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 29 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-09 06:34:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-09 06:34:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-08 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1)||G(p2))))'
Support contains 3 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 6796 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 7 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 24 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-09 06:34:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-09 06:34:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/900 places, 7/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 4/900 places, 7/6844 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(LT s0 1), p0:(LT s1 1), p2:(GEQ s2 1)], nbAcceptance=2, 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 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-09 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(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 6 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 13 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-09 06:34:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-09 06:34:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:37] [INFO ] Invariant cache hit.
[2023-03-09 06:34:37] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-10 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(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 3 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 10 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
[2023-03-09 06:34:38] [INFO ] Invariant cache hit.
[2023-03-09 06:34:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 06:34:38] [INFO ] Invariant cache hit.
[2023-03-09 06:34:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-09 06:34:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:38] [INFO ] Invariant cache hit.
[2023-03-09 06:34:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-11 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1 U (p2||G(p1))))))))'
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 158 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 06:34:38] [INFO ] Computed 1 place invariants in 58 ms
[2023-03-09 06:34:38] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 06:34:38] [INFO ] Invariant cache hit.
[2023-03-09 06:34:40] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2023-03-09 06:34:40] [INFO ] Invariant cache hit.
[2023-03-09 06:34:44] [INFO ] Dead Transitions using invariants and state equation in 4216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6006 ms. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s685 1), p2:(AND (LT s624 1) (LT s643 1)), p1:(LT s624 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 670 ms.
Product exploration explored 100000 steps with 33333 reset in 826 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 p2 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 p1)
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D30N050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-12 finished in 7958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(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 147 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
[2023-03-09 06:34:46] [INFO ] Invariant cache hit.
[2023-03-09 06:34:46] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-09 06:34:46] [INFO ] Invariant cache hit.
[2023-03-09 06:34:48] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-09 06:34:48] [INFO ] Invariant cache hit.
[2023-03-09 06:34:51] [INFO ] Dead Transitions using invariants and state equation in 3660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5394 ms. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s216 1), p0:(GEQ s264 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-13 finished in 5561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 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 6802 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 5 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 22 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-09 06:34:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:34:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 06:34:51] [INFO ] Invariant cache hit.
[2023-03-09 06:34:51] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 06:34:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:34:51] [INFO ] Invariant cache hit.
[2023-03-09 06:34:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/900 places, 7/6844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 4/900 places, 7/6844 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s0 1) (GEQ s2 1)), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 3 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N050-LTLFireability-14 finished in 277 ms.
All properties solved by simple procedures.
Total runtime 76489 ms.

BK_STOP 1678343693080

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-D30N050"
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-5348"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N050, 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 r133-smll-167819410400196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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