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.r197-smll-162089452200317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 SatelliteMemory-PT-X01000Y0032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089452200317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 11:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 11:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 12 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 5 16:52 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 SatelliteMemory-PT-X01000Y0032-00
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-01
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-02
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-03
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-04
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-05
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-06
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-07
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-08
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-09
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-10
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-11
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-12
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-13
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-14
FORMULA_NAME SatelliteMemory-PT-X01000Y0032-15

=== Now, execution of the tool begins

BK_START 1621116171768

Running Version 0
[2021-05-15 22:02:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-15 22:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 22:02:54] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-15 22:02:54] [INFO ] Transformed 13 places.
[2021-05-15 22:02:54] [INFO ] Transformed 10 transitions.
[2021-05-15 22:02:54] [INFO ] Parsed PT model containing 13 places and 10 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 22:02:54] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X01000Y0032-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 18 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-15 22:02:55] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:02:55] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:02:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
[2021-05-15 22:02:55] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-15 22:02:55] [INFO ] Flatten gal took : 26 ms
FORMULA SatelliteMemory-PT-X01000Y0032-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01000Y0032-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01000Y0032-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01000Y0032-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01000Y0032-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 22:02:55] [INFO ] Flatten gal took : 6 ms
[2021-05-15 22:02:55] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 12781 steps, including 0 resets, run visited all 12 properties in 106 ms. (steps per millisecond=120 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:55] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s8 1)), p1:(OR (LT s4 1) (LT s6 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-00 finished in 600 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:56] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-15 22:02:56] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:56] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-15 22:02:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:02:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s7 1) (AND (GEQ s3 936) (GEQ s6 64))), p0:(OR (LT s3 1) (LT s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2949 reset in 493 ms.
Stack based approach found an accepted trace after 44 steps with 3 reset with depth 16 and stack size 15 in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-02 finished in 810 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&X(X((X(((p2 U p0) U (!p0&&(p2 U p0))))||p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-15 22:02:57] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:57] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p1), (NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1)), p2:(GEQ s2 1), p1:(OR (LT s1 1) (LT s3 1) (LT s7 1) (LT s10 1))], 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-03 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 8 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 22:02:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 22:02:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 22:02:57] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-15 22:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2021-05-15 22:02:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-15 22:02:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1000)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-05 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((p0 U (p1||G(p0))))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-15 22:02:57] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:57] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:58] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-06 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (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 p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=6 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s4 1) (LT s6 1) (LT s8 1)), p1:(AND (GEQ s5 1000) (OR (LT s0 1) (LT s8 1))), p0:(GEQ s5 1000)], 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 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-06 finished in 590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((X(p0)&&F(p1))||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:02:58] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:58] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-15 22:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:02:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:02:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:02:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (OR (LT s3 936) (LT s5 936)) (OR (LT s3 936) (LT s6 64))), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23559 reset in 218 ms.
Product exploration explored 100000 steps with 23731 reset in 196 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 23877 reset in 249 ms.
Product exploration explored 100000 steps with 23755 reset in 291 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:00] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
[2021-05-15 22:03:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:00] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 23744 reset in 608 ms.
Product exploration explored 100000 steps with 23644 reset in 407 ms.
[2021-05-15 22:03:01] [INFO ] Flatten gal took : 4 ms
[2021-05-15 22:03:01] [INFO ] Flatten gal took : 4 ms
[2021-05-15 22:03:01] [INFO ] Time to serialize gal into /tmp/LTL1776608423361836873.gal : 2 ms
[2021-05-15 22:03:01] [INFO ] Time to serialize properties into /tmp/LTL4352854569030825247.ltl : 2 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/LTL1776608423361836873.gal, -t, CGAL, -LTL, /tmp/LTL4352854569030825247.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/LTL1776608423361836873.gal -t CGAL -LTL /tmp/LTL4352854569030825247.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p11>=1)"))||((X("(p11>=1)"))&&(F("(((p12<936)||(p3<936))&&((p12<936)||(p4<64)))")))))))
Formula 0 simplified : !XF(G"(p11>=1)" | (X"(p11>=1)" & F"(((p12<936)||(p3<936))&&((p12<936)||(p4<64)))"))
Detected timeout of ITS tools.
[2021-05-15 22:03:16] [INFO ] Flatten gal took : 6 ms
[2021-05-15 22:03:16] [INFO ] Applying decomposition
[2021-05-15 22:03:16] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7291289728523379761.txt, -o, /tmp/graph7291289728523379761.bin, -w, /tmp/graph7291289728523379761.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7291289728523379761.bin, -l, -1, -v, -w, /tmp/graph7291289728523379761.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:03:16] [INFO ] Decomposing Gal with order
[2021-05-15 22:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:03:16] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-15 22:03:16] [INFO ] Flatten gal took : 37 ms
[2021-05-15 22:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-15 22:03:16] [INFO ] Time to serialize gal into /tmp/LTL4999602765645854618.gal : 24 ms
[2021-05-15 22:03:16] [INFO ] Time to serialize properties into /tmp/LTL6938850511692660234.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/LTL4999602765645854618.gal, -t, CGAL, -LTL, /tmp/LTL6938850511692660234.ltl, -c, -stutter-deadlock], 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/LTL4999602765645854618.gal -t CGAL -LTL /tmp/LTL6938850511692660234.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(u3.p11>=1)"))||((X("(u3.p11>=1)"))&&(F("(((i0.u0.p12<936)||(i0.u2.p3<936))&&((i0.u0.p12<936)||(i0.u2.p4<64)))")))))))
Formula 0 simplified : !XF(G"(u3.p11>=1)" | (X"(u3.p11>=1)" & F"(((i0.u0.p12<936)||(i0.u2.p3<936))&&((i0.u0.p12<936)||(i0.u2.p4<64)))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16761044606534808192
[2021-05-15 22:03:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16761044606534808192
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16761044606534808192]
Compilation finished in 301 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16761044606534808192]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16761044606534808192]
LTSmin run took 514 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X01000Y0032-08 finished in 34413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:32] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:03:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:32] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:03:32] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:32] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:03:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-15 22:03:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:32] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:03:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 936) (GEQ s6 64)), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 146 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-10 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((X(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:03:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:03:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:03:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (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 p2))]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s3 936) (GEQ s6 64)), p1:(GEQ s5 1000), p2:(OR (GEQ s5 1000) (AND (GEQ s3 1) (GEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 163 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-12 finished in 558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:33] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:03:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:33] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-15 22:03:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s4 1) (LT s6 1) (LT s8 1))], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-14 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:34] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:34] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-15 22:03:34] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:34] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-15 22:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 22:03:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2021-05-15 22:03:34] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-15 22:03:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, p0, p0, p0]
Running random walk in product with property : SatelliteMemory-PT-X01000Y0032-15 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s5 1000)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5258 steps with 0 reset in 9 ms.
FORMULA SatelliteMemory-PT-X01000Y0032-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01000Y0032-15 finished in 289 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621116215593

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="SatelliteMemory-PT-X01000Y0032"
export BK_EXAMINATION="LTLFireability"
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 SatelliteMemory-PT-X01000Y0032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089452200317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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