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-165254772600828.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-D40N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772600828
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 8.2K Apr 30 04:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 04:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 04:45 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.3K 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 4.7M 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-D40N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652661695711

Running Version 202205111006
[2022-05-16 00:41:36] [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-16 00:41:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:41:37] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2022-05-16 00:41:37] [INFO ] Transformed 1600 places.
[2022-05-16 00:41:37] [INFO ] Transformed 12324 transitions.
[2022-05-16 00:41:37] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 410 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:41:38] [INFO ] Computed 1 place invariants in 138 ms
[2022-05-16 00:41:38] [INFO ] Implicit Places using invariants in 453 ms returned []
Implicit Place search using SMT only with invariants took 483 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:41:38] [INFO ] Computed 1 place invariants in 132 ms
[2022-05-16 00:41:42] [INFO ] Dead Transitions using invariants and state equation in 3925 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Support contains 24 out of 1600 places after structural reductions.
[2022-05-16 00:41:43] [INFO ] Flatten gal took : 447 ms
[2022-05-16 00:41:43] [INFO ] Flatten gal took : 252 ms
[2022-05-16 00:41:43] [INFO ] Input system was already deterministic with 12324 transitions.
Support contains 23 out of 1600 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 22) 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 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 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 15 ms. (steps per millisecond=66 ) 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 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 11 ms. (steps per millisecond=91 ) 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 13 ms. (steps per millisecond=77 ) 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 24 ms. (steps per millisecond=41 ) 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 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 15 ms. (steps per millisecond=66 ) 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 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 158724 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{5=1, 8=1, 13=1, 15=1, 16=1}
Probabilistic random walk after 158724 steps, saw 129187 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :5
Running SMT prover for 16 properties.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:41:47] [INFO ] Computed 1 place invariants in 73 ms
[2022-05-16 00:41:47] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2022-05-16 00:41:55] [INFO ] After 7057ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:11
[2022-05-16 00:41:57] [INFO ] After 9141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 00:41:57] [INFO ] After 10239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 00:41:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2022-05-16 00:42:05] [INFO ] After 7190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-16 00:42:11] [INFO ] After 12939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 3262 ms.
[2022-05-16 00:42:14] [INFO ] After 17191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 3 different solutions.
Finished Parikh walk after 12844 steps, including 0 resets, run visited all 16 properties in 343 ms. (steps per millisecond=37 )
Parikh walk visited 16 properties in 353 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12276 edges and 1600 vertex of which 1597 / 1600 are part of one of the 1 SCC in 16 ms
Free SCC test removed 1596 places
Ensure Unique test removed 12317 transitions
Reduce isomorphic transitions removed 12317 transitions.
Applied a total of 1 rules in 42 ms. Remains 4 /1600 variables (removed 1596) and now considering 7/12324 (removed 12317) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 00:42:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 00:42:15] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 00:42:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 00:42:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 00:42:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1600 places, 7/12324 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1600 places, 7/12324 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-02 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1)))&&X((G(X(p2))&&!p0))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 454 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:16] [INFO ] Computed 1 place invariants in 73 ms
[2022-05-16 00:42:16] [INFO ] Implicit Places using invariants in 245 ms returned []
Implicit Place search using SMT only with invariants took 246 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:16] [INFO ] Computed 1 place invariants in 70 ms
[2022-05-16 00:42:20] [INFO ] Dead Transitions using invariants and state equation in 3715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p1), (OR (NOT p2) p0), (NOT p1), true, (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s59 1), p1:(GEQ s1508 1), p2:(LT s1099 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 384 steps with 0 reset in 26 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-03 finished in 4770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 151 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:20] [INFO ] Computed 1 place invariants in 60 ms
[2022-05-16 00:42:20] [INFO ] Implicit Places using invariants in 224 ms returned []
Implicit Place search using SMT only with invariants took 226 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:21] [INFO ] Computed 1 place invariants in 56 ms
[2022-05-16 00:42:24] [INFO ] Dead Transitions using invariants and state equation in 3813 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-06 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: 1}]], initial=2, aps=[p0:(GEQ s1003 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 12 reset in 2476 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 2 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-06 finished in 6808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12298 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 16 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 32 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 00:42:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:27] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 00:42:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 00:42:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 00:42:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1600 places, 5/12324 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1600 places, 5/12324 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-07 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:(GEQ s0 1), p1:(GEQ 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 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-07 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(F(G(F(X(F(p0))))))||p1)))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 175 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:27] [INFO ] Computed 1 place invariants in 57 ms
[2022-05-16 00:42:28] [INFO ] Implicit Places using invariants in 219 ms returned []
Implicit Place search using SMT only with invariants took 220 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:28] [INFO ] Computed 1 place invariants in 58 ms
[2022-05-16 00:42:31] [INFO ] Dead Transitions using invariants and state equation in 3639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s1538 1), p0:(LT s548 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 2745 ms.
Stack based approach found an accepted trace after 18448 steps with 1 reset with depth 9365 and stack size 9343 in 494 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-08 finished in 7523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(!X(p0)))) U G((F(p1)||X(p2)))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 150 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:35] [INFO ] Computed 1 place invariants in 64 ms
[2022-05-16 00:42:35] [INFO ] Implicit Places using invariants in 224 ms returned []
Implicit Place search using SMT only with invariants took 225 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:35] [INFO ] Computed 1 place invariants in 69 ms
[2022-05-16 00:42:39] [INFO ] Dead Transitions using invariants and state equation in 3712 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2 p0), (AND (NOT p1) p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s114 1), p2:(GEQ s1202 1), p0:(GEQ s1116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20044 reset in 831 ms.
Stack based approach found an accepted trace after 114 steps with 25 reset with depth 4 and stack size 4 in 1 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-09 finished in 5136 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 141 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:40] [INFO ] Computed 1 place invariants in 61 ms
[2022-05-16 00:42:40] [INFO ] Implicit Places using invariants in 228 ms returned []
Implicit Place search using SMT only with invariants took 228 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:40] [INFO ] Computed 1 place invariants in 59 ms
[2022-05-16 00:42:44] [INFO ] Dead Transitions using invariants and state equation in 3668 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s1307 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 24388 steps with 0 reset in 887 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-10 finished in 5216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)||p1))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 142 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:45] [INFO ] Computed 1 place invariants in 66 ms
[2022-05-16 00:42:45] [INFO ] Implicit Places using invariants in 229 ms returned []
Implicit Place search using SMT only with invariants took 230 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:45] [INFO ] Computed 1 place invariants in 57 ms
[2022-05-16 00:42:49] [INFO ] Dead Transitions using invariants and state equation in 3676 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1169 1), p1:(GEQ s1138 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 15 reset in 2204 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 1 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-11 finished in 6375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 22 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 34 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 00:42:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:51] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 00:42:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 00:42:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 00:42:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:42:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1600 places, 3/12324 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, 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-D40N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-12 finished in 151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||!(G(X(p0)) U p2)))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 144 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:52] [INFO ] Computed 1 place invariants in 61 ms
[2022-05-16 00:42:52] [INFO ] Implicit Places using invariants in 220 ms returned []
Implicit Place search using SMT only with invariants took 221 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2022-05-16 00:42:52] [INFO ] Computed 1 place invariants in 54 ms
[2022-05-16 00:42:56] [INFO ] Dead Transitions using invariants and state equation in 3700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p2), (AND p0 p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=4, aps=[p0:(GEQ s110 1), p1:(GEQ s970 1), p2:(GEQ s808 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1291 ms.
Product exploration explored 100000 steps with 50000 reset in 1350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0 p2))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p2)))
Knowledge based reduction with 15 factoid took 269 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-14 finished in 7291 ms.
All properties solved by simple procedures.
Total runtime 82510 ms.

BK_STOP 1652661779360

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

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