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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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.9K 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 3.0K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 469K 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-d4n3m2c23-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-15

=== Now, execution of the tool begins

BK_START 1620928374247

Running Version 0
[2021-05-13 17:53:05] [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:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:53:05] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-13 17:53:05] [INFO ] Transformed 81 places.
[2021-05-13 17:53:05] [INFO ] Transformed 1632 transitions.
[2021-05-13 17:53:05] [INFO ] Parsed PT model containing 81 places and 1632 transitions in 128 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:53:05] [INFO ] Initial state test concluded for 3 properties.
FORMULA NeighborGrid-PT-d4n3m2c23-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 19 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:05] [INFO ] Computed 1 place invariants in 34 ms
[2021-05-13 17:53:05] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:05] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-13 17:53:05] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:05] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:53:06] [INFO ] Dead Transitions using invariants and state equation in 492 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
[2021-05-13 17:53:06] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 17:53:06] [INFO ] Flatten gal took : 120 ms
FORMULA NeighborGrid-PT-d4n3m2c23-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:53:06] [INFO ] Flatten gal took : 62 ms
[2021-05-13 17:53:06] [INFO ] Input system was already deterministic with 1632 transitions.
Finished random walk after 1520 steps, including 0 resets, run visited all 24 properties in 37 ms. (steps per millisecond=41 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1532 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 4 ms
Free SCC test removed 78 places
Ensure Unique test removed 1627 transitions
Reduce isomorphic transitions removed 1627 transitions.
Applied a total of 1 rules in 15 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-13 17:53:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:06] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-13 17:53:06] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s1)], 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 26 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-01 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:07] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:07] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-13 17:53:07] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:07] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:07] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 122 ms :[(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-d4n3m2c23-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ s18 s10), p0:(AND (LEQ 1 s50) (LEQ 3 s27))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 133 steps with 0 reset in 18 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-02 finished in 1007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:08] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:08] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:08] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:08] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:08] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:08] [INFO ] Dead Transitions using invariants and state equation in 457 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 s24), p0:(LEQ s52 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13614 reset in 5413 ms.
Stack based approach found an accepted trace after 6012 steps with 1464 reset with depth 734 and stack size 734 in 315 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-03 finished in 6527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p1&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 20 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:14] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:14] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:14] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:14] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:19] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:19] [INFO ] Dead Transitions using invariants and state equation in 4981 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s20 s50), p0:(LEQ s44 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18763 reset in 5029 ms.
Stack based approach found an accepted trace after 1182 steps with 211 reset with depth 451 and stack size 451 in 61 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-04 finished in 10404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1432 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 1619 transitions
Reduce isomorphic transitions removed 1619 transitions.
Applied a total of 1 rules in 5 ms. Remains 5 /81 variables (removed 76) and now considering 13/1632 (removed 1619) transitions.
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-13 17:53:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 13/1632 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} 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:(LEQ s4 s1), p0:(GT s2 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 5 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-05 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1550 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 2 ms
Free SCC test removed 78 places
Ensure Unique test removed 1627 transitions
Reduce isomorphic transitions removed 1627 transitions.
Applied a total of 1 rules in 4 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-13 17:53:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:25] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-06 finished in 75 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1||F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:25] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:26] [INFO ] Dead Transitions using invariants and state equation in 511 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GT 3 s0) (GT s61 s16)), p1:(LEQ s43 s27), p2:(GT s72 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 5899 ms.
Stack based approach found an accepted trace after 16581 steps with 4 reset with depth 16574 and stack size 13984 in 998 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-07 finished in 7767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1338 edges and 81 vertex of which 75 / 81 are part of one of the 1 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 1605 transitions
Reduce isomorphic transitions removed 1605 transitions.
Applied a total of 1 rules in 4 ms. Remains 7 /81 variables (removed 74) and now considering 27/1632 (removed 1605) transitions.
// Phase 1: matrix 27 rows 7 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:33] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 27 rows 7 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:33] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-13 17:53:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 7 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:53:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/81 places, 27/1632 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LEQ s0 s3) (LEQ s2 s4) (LEQ s5 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-08 finished in 106 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 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:53:33] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:33] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:33] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:53:33] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s72 s65)], 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 19300 reset in 4986 ms.
Stack based approach found an accepted trace after 2777 steps with 742 reset with depth 884 and stack size 884 in 134 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-09 finished in 5916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:39] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:39] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:39] [INFO ] Computed 1 place invariants in 16 ms
[2021-05-13 17:53:39] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:39] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:53:39] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(LEQ s8 s53)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 21 reset in 2 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-11 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(((p1 U !p0)&&(F(p2)||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:39] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:53:39] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:39] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:53:40] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:40] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-13 17:53:40] [INFO ] Dead Transitions using invariants and state equation in 455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), p0, true, true, true, (OR (NOT p2) p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(GT s20 s3), p0:(GT 1 s64), p1:(LEQ s42 s56)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-12 finished in 872 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)) U X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:40] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:53:40] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:40] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:53:41] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:41] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-13 17:53:41] [INFO ] Dead Transitions using invariants and state equation in 445 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-14 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 1 s63), p0:(AND (GT 1 s7) (LEQ 1 s63)), p1:(LEQ s3 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1216 steps with 6 reset in 74 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-14 finished in 863 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620928422658

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

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