fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821600963
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for NeighborGrid-PT-d2n3m1t12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
194.380 5768.00 9579.00 543.60 FFFTFFFFFTTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 8.3K Apr 29 14:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 14:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 14:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 19K May 10 09:34 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-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652907432612

Running Version 202205111006
[2022-05-18 20:57:13] [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]
[2022-05-18 20:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 20:57:13] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2022-05-18 20:57:13] [INFO ] Transformed 9 places.
[2022-05-18 20:57:13] [INFO ] Transformed 72 transitions.
[2022-05-18 20:57:13] [INFO ] Parsed PT model containing 9 places and 72 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:14] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-18 20:57:14] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-18 20:57:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-18 20:57:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-18 20:57:14] [INFO ] Flatten gal took : 20 ms
[2022-05-18 20:57:14] [INFO ] Flatten gal took : 7 ms
[2022-05-18 20:57:14] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 84 steps, including 0 resets, run visited all 15 properties in 944 ms. (steps per millisecond=0 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(X(p0)))&&F(p1)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 7 ms. Remains 3 /9 variables (removed 6) and now considering 7/72 (removed 65) transitions.
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:15] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-18 20:57:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 7/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/72 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s2), p0:(GT 1 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 0 steps with 0 reset in 2 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-00 finished in 367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((p0 U !p0)))&&F(X(X(!p0)))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 1 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 2 ms. Remains 2 /9 variables (removed 7) and now considering 3/72 (removed 69) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 20:57:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-18 20:57:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/9 places, 3/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/9 places, 3/72 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s0)], 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 1 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-01 finished in 140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 1 ms. Remains 3 /9 variables (removed 6) and now considering 7/72 (removed 65) transitions.
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-18 20:57:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 7/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/72 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-02 finished in 143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X(G(!(F(p0) U (p0 U p1))))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-18 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, p1, p1, p1]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GT s3 s7) (LEQ s8 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-05 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U (F(p0)&&p1))&&p2))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s2 s4), p1:(LEQ 3 s2), p2:(OR (LEQ 3 s7) (LEQ s6 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 913 reset in 377 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-06 finished in 671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 1 ms. Remains 3 /9 variables (removed 6) and now considering 7/72 (removed 65) transitions.
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-18 20:57:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 7/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/72 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-07 finished in 120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 2 ms. Remains 3 /9 variables (removed 6) and now considering 7/72 (removed 65) transitions.
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-18 20:57:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/9 places, 7/72 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/72 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-08 automaton TGBA Formula[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:(LEQ s0 s2)], 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 14 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-08 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s6), p1:(GT s2 s8)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-13 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))&&X(F((X(p2)||p0)))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 20:57:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2022-05-18 20:57:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1t12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s3 s2), p1:(GT 1 s5), p2:(GT 3 s1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23293 reset in 323 ms.
Stack based approach found an accepted trace after 168 steps with 32 reset with depth 17 and stack size 17 in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1t12-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property NeighborGrid-PT-d2n3m1t12-LTLCardinality-15 finished in 594 ms.
All properties solved by simple procedures.
Total runtime 4565 ms.

BK_STOP 1652907438380

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d2n3m1t12"
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-d2n3m1t12, 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 r132-tall-165271821600963"
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 [ "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 ;