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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
258.552 12757.00 20154.00 433.30 FTFFFTFTFTFFFFTF 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-165271821600979.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-d4n3m2c23, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821600979
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.6K Apr 29 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 14:52 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.8K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K 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.9K 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 469K 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-d4n3m2c23-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652909429862

Running Version 202205111006
[2022-05-18 21:30:30] [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 21:30:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:30:31] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-05-18 21:30:31] [INFO ] Transformed 81 places.
[2022-05-18 21:30:31] [INFO ] Transformed 1632 transitions.
[2022-05-18 21:30:31] [INFO ] Parsed PT model containing 81 places and 1632 transitions in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-18 21:30:31] [INFO ] Computed 1 place invariants in 38 ms
[2022-05-18 21:30:31] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:31] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-18 21:30:31] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:31] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-18 21:30:32] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Support contains 17 out of 81 places after structural reductions.
[2022-05-18 21:30:32] [INFO ] Flatten gal took : 101 ms
[2022-05-18 21:30:32] [INFO ] Flatten gal took : 47 ms
[2022-05-18 21:30:32] [INFO ] Input system was already deterministic with 1632 transitions.
Finished random walk after 940 steps, including 0 resets, run visited all 13 properties in 86 ms. (steps per millisecond=10 )
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' '!(X(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-18 21:30:33] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-18 21:30:33] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:33] [INFO ] Computed 1 place invariants in 18 ms
[2022-05-18 21:30:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:33] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-18 21:30:33] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 521 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s75 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18969 reset in 5767 ms.
Stack based approach found an accepted trace after 906 steps with 233 reset with depth 14 and stack size 14 in 50 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-00 finished in 7110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||G(p1))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1448 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 5 ms
Free SCC test removed 76 places
Ensure Unique test removed 1617 transitions
Reduce isomorphic transitions removed 1617 transitions.
Applied a total of 1 rules in 14 ms. Remains 5 /81 variables (removed 76) and now considering 15/1632 (removed 1617) transitions.
// Phase 1: matrix 15 rows 5 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 15 rows 5 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-18 21:30:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 5 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:30:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/81 places, 15/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 15/1632 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s2), p1:(OR (GT 1 s0) (GT 2 s3))], 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-d4n3m2c23-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-02 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1592 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 11 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-18 21:30:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:40] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/81 places, 5/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 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 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-04 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:30:40] [INFO ] Implicit Places using invariants and state equation in 207 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
[2022-05-18 21:30:40] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-18 21:30:41] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s56)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1099 steps with 0 reset in 79 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-08 finished in 870 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(X(F(!G(!X(p0)))))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1580 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 3 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 7 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-18 21:30:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/81 places, 5/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-10 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 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 1 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-10 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(X(G(F(X(G(p0))))))))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1568 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 3 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 9 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-18 21:30:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/81 places, 5/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 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 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-11 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 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1612 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 4 ms
Free SCC test removed 79 places
Ensure Unique test removed 1629 transitions
Reduce isomorphic transitions removed 1629 transitions.
Applied a total of 1 rules in 7 ms. Remains 2 /81 variables (removed 79) and now considering 3/1632 (removed 1629) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:30:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-18 21:30:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-18 21:30:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/81 places, 3/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/81 places, 3/1632 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 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 226 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-12 finished in 116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p0&&F(G(p1))))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1562 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 5 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 10 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:42] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-18 21:30:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:30:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/81 places, 5/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s1), p1:(GT 2 s0)], nbAcceptance=2, 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 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-13 finished in 486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)&&F(p2)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1520 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 1 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 4 ms. Remains 5 /81 variables (removed 76) and now considering 13/1632 (removed 1619) transitions.
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-18 21:30:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-18 21:30:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2022-05-18 21:30:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-18 21:30:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/81 places, 13/1632 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 13/1632 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s2 s3), p0:(LEQ 1 s1), p2:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-LTLCardinality-15 finished in 259 ms.
All properties solved by simple procedures.
Total runtime 11583 ms.

BK_STOP 1652909442619

--------------------
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-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 r132-tall-165271821600979"
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 ;