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-162089127200076.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-d2n3m1c12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-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 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.3K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 3.8K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 11K 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-d2n3m1c12-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-15

=== Now, execution of the tool begins

BK_START 1620927260128

Running Version 0
[2021-05-13 17:34:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:34:22] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 17:34:22] [INFO ] Transformed 9 places.
[2021-05-13 17:34:22] [INFO ] Transformed 40 transitions.
[2021-05-13 17:34:22] [INFO ] Parsed PT model containing 9 places and 40 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 17:34:22] [INFO ] Initial state test concluded for 2 properties.
FORMULA NeighborGrid-PT-d2n3m1c12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:34:22] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:34:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
[2021-05-13 17:34:22] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 17:34:22] [INFO ] Flatten gal took : 20 ms
FORMULA NeighborGrid-PT-d2n3m1c12-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:34:22] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:34:22] [INFO ] Input system was already deterministic with 40 transitions.
Finished random walk after 133 steps, including 0 resets, run visited all 18 properties in 3 ms. (steps per millisecond=44 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U G(p0))&&X((p1||(X(p2) U ((p3&&X(p2))||X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:22] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-13 17:34:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p3 p2), acceptance={} source=3 dest: 4}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s8 s6), p1:(GT s3 s6), p3:(GT s8 s0), p2:(GT s3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-00 finished in 432 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:34:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s8) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 37035 reset in 275 ms.
Stack based approach found an accepted trace after 91 steps with 37 reset with depth 6 and stack size 6 in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-04 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:23] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s7 s6), p1:(GT s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-06 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:23] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:23] [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 40 rows 9 cols
[2021-05-13 17:34:23] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 27509 reset in 188 ms.
Stack based approach found an accepted trace after 264 steps with 81 reset with depth 28 and stack size 28 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-07 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F((p0&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 24 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 18 ms
Free SCC test removed 6 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Applied a total of 1 rules in 29 ms. Remains 3 /9 variables (removed 6) and now considering 5/40 (removed 35) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-13 17:34:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 5/40 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s0), p0:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-08 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 24 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /9 variables (removed 6) and now considering 5/40 (removed 35) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 17:34:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 5/40 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-09 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}]], initial=0, aps=[p0:(GT s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 NeighborGrid-PT-d2n3m1c12-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-09 finished in 94 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&(p1||F(G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:24] [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 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s6), p1:(LEQ s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5301 reset in 234 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-10 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [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 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s5), p2:(LEQ s8 s3), p0:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 386 steps with 180 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-11 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 28 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /9 variables (removed 6) and now considering 5/40 (removed 35) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-13 17:34:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 5/40 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s0 s1), p1:(GT 1 s0)], 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 25 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-13 finished in 86 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(X(F(!p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:24] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:24] [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 40 rows 9 cols
[2021-05-13 17:34:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-14 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(LEQ 1 s5), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6864 reset in 190 ms.
Stack based approach found an accepted trace after 44 steps with 5 reset with depth 14 and stack size 14 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-14 finished in 411 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620927266393

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-d2n3m1c12"
export BK_EXAMINATION="LTLCardinality"
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-d2n3m1c12, examination is LTLCardinality"
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-162089127200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;