Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 19K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620927397767

Running Version 0
[2021-05-13 17:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 17:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:36:39] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 17:36:39] [INFO ] Transformed 9 places.
[2021-05-13 17:36:39] [INFO ] Transformed 72 transitions.
[2021-05-13 17:36:39] [INFO ] Parsed PT model containing 9 places and 72 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 17:36:39] [INFO ] Initial state test concluded for 3 properties.
FORMULA NeighborGrid-PT-d2n3m1t12-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:39] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:36:39] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:39] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-13 17:36:39] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
[2021-05-13 17:36:40] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-13 17:36:40] [INFO ] Flatten gal took : 23 ms
FORMULA NeighborGrid-PT-d2n3m1t12-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:36:40] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:36:40] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 12 properties in 2 ms. (steps per millisecond=12 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 42 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Applied a total of 1 rules in 9 ms. Remains 3 /9 variables (removed 6) and now considering 7/72 (removed 65) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:40] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:40] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-13 17:36:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:40] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/72 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-00 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((G(p1)||(X((F(p2) U p3))&&F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:40] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:36:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:40] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:36:40] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s1 1), p3:(GEQ s4 1), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37990 reset in 409 ms.
Stack based approach found an accepted trace after 118 steps with 42 reset with depth 10 and stack size 10 in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-01 finished in 789 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G((p0||X(p1))))||(p0 U !p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, false, true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s5 1), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 1 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-02 finished in 197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s4 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-03 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 56 edges and 9 vertex of which 8 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /9 variables (removed 7) and now considering 3/72 (removed 69) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-13 17:36:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/9 places, 3/72 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT 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 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-05 finished in 72 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (!p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s6 1), p0:(OR (LT s8 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-06 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 10 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-07 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0||X((G(p1) U (p0&&G(p1))))) U (G((p0||X((G(p1) U (p0&&G(p1))))))||(!p1&&(p0||X((G(p1) U (p0&&G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2593 reset in 289 ms.
Stack based approach found an accepted trace after 46 steps with 1 reset with depth 16 and stack size 16 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-14 finished in 435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(G(F(p1)) U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 30 edges and 9 vertex of which 6 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /9 variables (removed 5) and now considering 13/72 (removed 59) transitions.
// Phase 1: matrix 13 rows 4 cols
[2021-05-13 17:36:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:42] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 13 rows 4 cols
[2021-05-13 17:36:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-13 17:36:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 4 cols
[2021-05-13 17:36:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:36:42] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/9 places, 13/72 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3 1), p2:(GEQ s1 1), p1:(OR (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-15 finished in 201 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620927405601

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

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

Sequence of Actions to be Executed by the VM

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

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

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