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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.8K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.1K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 07:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 46K 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-d3n3m1t11-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-15

=== Now, execution of the tool begins

BK_START 1620928075158

Running Version 0
[2021-05-13 17:48: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:48:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:48:05] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-13 17:48:05] [INFO ] Transformed 27 places.
[2021-05-13 17:48:05] [INFO ] Transformed 162 transitions.
[2021-05-13 17:48:05] [INFO ] Parsed PT model containing 27 places and 162 transitions in 70 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:48:05] [INFO ] Initial state test concluded for 2 properties.
FORMULA NeighborGrid-PT-d3n3m1t11-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:05] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:48:05] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:05] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-13 17:48:05] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:05] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-13 17:48:05] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
[2021-05-13 17:48:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 17:48:05] [INFO ] Flatten gal took : 34 ms
FORMULA NeighborGrid-PT-d3n3m1t11-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:48:05] [INFO ] Flatten gal took : 13 ms
[2021-05-13 17:48:05] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 36396 steps, including 1 resets, run visited all 28 properties in 28 ms. (steps per millisecond=1299 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&G((F(p2)&&F(p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 84 edges and 27 vertex of which 20 / 27 are part of one of the 1 SCC in 3 ms
Free SCC test removed 19 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Applied a total of 1 rules in 10 ms. Remains 8 /27 variables (removed 19) and now considering 21/162 (removed 141) transitions.
// Phase 1: matrix 21 rows 8 cols
[2021-05-13 17:48:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:05] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 8 cols
[2021-05-13 17:48:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:05] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-13 17:48:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 8 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/27 places, 21/162 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s4 s6), p0:(LEQ 1 s3), p2:(LEQ s5 s0), p3:(GT s1 s2)], 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, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-00 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||(G(p1)&&X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-01 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s13 s15), p0:(GT 2 s9), p2:(LEQ 3 s4)], 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]]
Product exploration explored 100000 steps with 30378 reset in 622 ms.
Stack based approach found an accepted trace after 37 steps with 10 reset with depth 18 and stack size 18 in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-01 finished in 867 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1||X((p2||F(p3)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:07] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s3 s2), p3:(LEQ s5 s18), p2:(LEQ s21 s18), p0:(GT s26 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 47066 reset in 441 ms.
Stack based approach found an accepted trace after 9116 steps with 4311 reset with depth 17 and stack size 17 in 53 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-02 finished in 783 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-03 automaton TGBA [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:(GT s22 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-03 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0)) U (p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-06 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (LEQ 2 s14) (GT s2 s0)), p1:(GT s2 s0), p0:(LEQ 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-06 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 138 edges and 27 vertex of which 25 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /27 variables (removed 24) and now considering 5/162 (removed 157) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-13 17:48:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/27 places, 5/162 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s1), p1:(GT 2 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 1 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-07 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-09 automaton TGBA [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 3 s1), p1:(AND (GT s3 s21) (GT 3 s7))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-09 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 140 edges and 27 vertex of which 25 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /27 variables (removed 24) and now considering 7/162 (removed 155) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-13 17:48:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/27 places, 7/162 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} 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-d3n3m1t11-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-11 finished in 53 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||X((p1||G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s0), p1:(LEQ s6 s2), p2:(GT 3 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17547 reset in 643 ms.
Stack based approach found an accepted trace after 530 steps with 104 reset with depth 6 and stack size 6 in 4 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-12 finished in 948 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||(G(F(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 10249 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LEQ s23 s15) (LEQ 1 s9)), p1:(GT s23 s15), p0:(LEQ s16 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Knowledge obtained : [p2, (NOT p1), p0]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Support contains 5 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 108 edges and 27 vertex of which 22 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Applied a total of 1 rules in 1 ms. Remains 6 /27 variables (removed 21) and now considering 17/162 (removed 145) transitions.
[2021-05-13 17:48:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 6 cols
[2021-05-13 17:48:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:22] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/27 places, 17/162 transitions.
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Product exploration explored 100000 steps with 50000 reset in 447 ms.
[2021-05-13 17:48:23] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:48:23] [INFO ] Flatten gal took : 6 ms
[2021-05-13 17:48:23] [INFO ] Time to serialize gal into /tmp/LTL6448607602624981069.gal : 3 ms
[2021-05-13 17:48:23] [INFO ] Time to serialize properties into /tmp/LTL17241455805043403934.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6448607602624981069.gal, -t, CGAL, -LTL, /tmp/LTL17241455805043403934.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6448607602624981069.gal -t CGAL -LTL /tmp/LTL17241455805043403934.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X("(p_1_2_1<=p_2_2_0)"))||((G(F("(p_2_1_2>p_1_2_0)")))U("((p_2_1_2<=p_1_2_0)||(p_1_0_0>=1))")))))
Formula 0 simplified : !X(X"(p_1_2_1<=p_2_2_0)" | (GF"(p_2_1_2>p_1_2_0)" U "((p_2_1_2<=p_1_2_0)||(p_1_0_0>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
69 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.707266,28096,1,0,6,66511,14,0,1680,57204,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeighborGrid-PT-d3n3m1t11-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NeighborGrid-PT-d3n3m1t11-13 finished in 14131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:23] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:23] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0, p0]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s14)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-14 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 130 edges and 27 vertex of which 24 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /27 variables (removed 23) and now considering 11/162 (removed 151) transitions.
// Phase 1: matrix 11 rows 4 cols
[2021-05-13 17:48:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:24] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2021-05-13 17:48:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:24] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-13 17:48:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 4 cols
[2021-05-13 17:48:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:24] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/27 places, 11/162 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2 s0), p1:(GT 3 s1)], 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 4 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-15 finished in 98 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620928105195

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

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