Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 8.2K Apr 29 11:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 11:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 12 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652959613011

Running Version 202205111006
[2022-05-19 11:26: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]
[2022-05-19 11:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:26:54] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2022-05-19 11:26:54] [INFO ] Transformed 13 places.
[2022-05-19 11:26:54] [INFO ] Transformed 10 transitions.
[2022-05-19 11:26:54] [INFO ] Parsed PT model containing 13 places and 10 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:26:54] [INFO ] Computed 6 place invariants in 17 ms
[2022-05-19 11:26:54] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:26:54] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-19 11:26:54] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:26:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:26:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:26:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:26:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2022-05-19 11:26:54] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:26:54] [INFO ] Flatten gal took : 3 ms
[2022-05-19 11:26:54] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:26:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:26:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 11:26:55] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 11:26:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 11:26:55] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 11:26:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:26:55] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 11:26:55] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-05-19 11:26:55] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 17628 steps, including 0 resets, run visited all 2 properties in 150 ms. (steps per millisecond=117 )
Parikh walk visited 3 properties in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-19 11:26:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 11:26:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:26:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 11:26:56] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:26:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 11:26:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:26:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-19 11:26:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:26:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 11:26:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 4496 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 3000)], 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 2 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-00 finished in 4673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(G(p0))||G(X(F(p1))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:01] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-19 11:27:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 3000), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6 reset in 199 ms.
Stack based approach found an accepted trace after 15610 steps with 0 reset with depth 15611 and stack size 10862 in 28 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-01 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)||p1))||p2)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-19 11:27:01] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:01] [INFO ] Implicit Places using invariants and state equation in 28 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
[2022-05-19 11:27:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 1462 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)), p2:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-02 finished in 1601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(!(G(p1)&&p0) U p2)||(F(p1)&&!p2))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, 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
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:03] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 11:27:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 65 ms :[p2, (AND p2 (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16406 reset in 104 ms.
Stack based approach found an accepted trace after 27 steps with 5 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-03 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((p0 U F(!G(p1))))&&F(p0)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:03] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 2812) (GEQ s5 2812)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:04] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 11:27:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 11:27:04] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:27:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 11:27:04] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:04] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:27:04] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-19 11:27:04] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6003 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=667 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:05] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 11:27:05] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:05] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 11:27:05] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:27:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 11:27:05] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:27:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:05] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:27:05] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-19 11:27:05] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6003 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1200 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Product exploration explored 100000 steps with 1 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), p1]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-19 11:27:08] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2022-05-19 11:27:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:08] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 1 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Built C files in :
/tmp/ltsmin18171680255425801673
[2022-05-19 11:27:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18171680255425801673
Running compilation step : cd /tmp/ltsmin18171680255425801673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin18171680255425801673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18171680255425801673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10674903393113623198.hoa' '--buchi-type=spotba'
LTSmin run took 2537 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-04 finished in 8206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(G((X(p1) U p1))) U X(X(p2))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:11] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 952 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), false, false]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 6}, { cond=p0, acceptance={1} source=1 dest: 7}, { cond=p0, acceptance={0, 1} source=1 dest: 8}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 10}, { cond=(NOT p2), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 13}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=8 dest: 8}], [{ cond=true, acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={} source=10 dest: 9}], [{ cond=(NOT p1), acceptance={} source=11 dest: 10}, { cond=true, acceptance={} source=11 dest: 11}], [{ cond=(NOT p1), acceptance={} source=12 dest: 2}, { cond=(NOT p1), acceptance={} source=12 dest: 5}], [{ cond=(NOT p1), acceptance={} source=13 dest: 3}, { cond=true, acceptance={} source=13 dest: 4}, { cond=(NOT p1), acceptance={} source=13 dest: 12}, { cond=true, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=14 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=14 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=14 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=14 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=14 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=14 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=15 dest: 6}, { cond=(AND p0 p2), acceptance={1} source=15 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p0) p2), acceptance={} source=15 dest: 13}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=15 dest: 14}, { cond=(AND p0 p2), acceptance={} source=15 dest: 15}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s7 1), p2:(AND (GEQ s3 2812) (GEQ s5 2812))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 98 ms.
Product exploration explored 100000 steps with 3 reset in 150 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 7 factoid took 892 ms. Reduced automaton from 16 states, 67 edges and 3 AP to 16 states, 67 edges and 3 AP.
Stuttering acceptance computed with spot in 564 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 11:27:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 11:27:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 11:27:15] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-05-19 11:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:15] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2022-05-19 11:27:15] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 11:27:15] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5628 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=703 )
Parikh walk visited 5 properties in 138 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F p1)]
Knowledge based reduction with 10 factoid took 1334 ms. Reduced automaton from 16 states, 67 edges and 3 AP to 16 states, 53 edges and 3 AP.
Stuttering acceptance computed with spot in 2853 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 523 ms :[(NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), false, false]
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:20] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F p1), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 925 ms. Reduced automaton from 16 states, 53 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-05 finished in 9547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((F(p0)&&p1))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-19 11:27:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s4 3000), p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-06 finished in 178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&p1))&&G(X(p0))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 11:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LT s7 1), p1:(OR (LT s11 3000) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-07 finished in 225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, p1, p1, p1]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-08 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (F(X(!(!F(p1)||!p0)))||X(p2)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:21] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:22] [INFO ] Implicit Places using invariants and state equation in 34 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
[2022-05-19 11:27:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 2177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s9 1)), p0:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)), p1:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20597 reset in 72 ms.
Stack based approach found an accepted trace after 21 steps with 5 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-09 finished in 2389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1 U (p2||G(p1))))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LT s2 1), p2:(AND (NOT (AND (GEQ s0 1) (GEQ s8 1))) (LT s7 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-10 finished in 223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(p2))&&p1)))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)), p0:(AND (GEQ s0 1) (GEQ s8 1)), p2:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8970 reset in 66 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-X03000Y0094-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-11 finished in 225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(X(X(G(p1))))||F(p2)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 11:27:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=3, aps=[p2:(AND (GEQ s3 1) (GEQ s9 1)), p0:(GEQ s7 1), p1:(AND (GEQ s3 2812) (GEQ s6 188))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13797 reset in 61 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-12 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F((F(p0)&&p0)))&&(F(!p0) U F(p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 0 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 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 11:27:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:25] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:25] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-19 11:27:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 11:27:25] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(OR (LT s2 1) (LT s7 1))], 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-13 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||F(X(G(!p0)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-19 11:27:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:25] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-19 11:27:25] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:27:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-19 11:27:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 11:27:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 126 ms :[false, p0, false, false]
Running random walk in product with property : SatelliteMemory-PT-X03000Y0094-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 9 in 1 ms.
FORMULA SatelliteMemory-PT-X03000Y0094-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X03000Y0094-LTLFireability-14 finished in 304 ms.
All properties solved by simple procedures.
Total runtime 31563 ms.

BK_STOP 1652959645768

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SatelliteMemory-PT-X03000Y0094"
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-X03000Y0094, 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 r204-oct2-165281599100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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