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-165281599600660.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 SharedMemory-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599600660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 20K Apr 30 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 30 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 30 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 142K Apr 30 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 83K 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 SharedMemory-PT-000005-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652982213061

Running Version 202205111006
[2022-05-19 17:43:34] [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 17:43:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:43:34] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2022-05-19 17:43:34] [INFO ] Transformed 41 places.
[2022-05-19 17:43:34] [INFO ] Transformed 55 transitions.
[2022-05-19 17:43:34] [INFO ] Found NUPN structural information;
[2022-05-19 17:43:34] [INFO ] Parsed PT model containing 41 places and 55 transitions in 173 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.
FORMULA SharedMemory-PT-000005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 13 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-19 17:43:34] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-19 17:43:34] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:34] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-19 17:43:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Support contains 41 out of 41 places after structural reductions.
[2022-05-19 17:43:35] [INFO ] Flatten gal took : 23 ms
[2022-05-19 17:43:35] [INFO ] Flatten gal took : 10 ms
[2022-05-19 17:43:35] [INFO ] Input system was already deterministic with 55 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:35] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-19 17:43:35] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-19 17:43:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA SharedMemory-PT-000005-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(G(X(p0)) U p0) U p0)))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:35] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:35] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:35] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:35] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), p0]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s0 1) (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22539 reset in 343 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-01 finished in 741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-03 automaton TGBA Formula[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}]], initial=3, aps=[p0:(AND (NEQ s32 1) (NEQ s25 1) (NEQ s27 1) (NEQ s28 1) (NEQ s31 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 SharedMemory-PT-000005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-03 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X(p0))||F(F(X(p1)))))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-19 17:43:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:36] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (OR (EQ s19 0) (EQ s22 0) (EQ s30 0)) (OR (EQ s19 0) (EQ s22 0) (EQ s33 0)) (OR (EQ s19 0) (EQ s26 0) (EQ s36 0)) (OR (EQ s19 0) (EQ s26 0) (EQ s3...], 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 20791 reset in 204 ms.
Product exploration explored 100000 steps with 20677 reset in 174 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 p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-19 17:43:38] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), true, (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000005-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000005-LTLFireability-04 finished in 1726 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:38] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-19 17:43:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 0) (EQ s25 0) (EQ s27 0) (EQ s28 0) (EQ s31 0))], 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]]
Product exploration explored 100000 steps with 7809 reset in 130 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-05 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))&&X(p0)))&&G(X(p0))))'
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:38] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:38] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s21 1) (EQ s39 1)) (AND (EQ s22 1) (EQ s34 1)) (AND (EQ s26 1) (EQ s38 1)) (AND (EQ s23 1) (EQ s37 1)) (AND (EQ s24 1) (EQ s40 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-07 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s32 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 17121 reset in 117 ms.
Stack based approach found an accepted trace after 137 steps with 34 reset with depth 10 and stack size 10 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-08 finished in 345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(G(X((p0 U p1))))))||G((F(p0) U p2))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 43
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 29 transition count 43
Applied a total of 24 rules in 3 ms. Remains 29 /41 variables (removed 12) and now considering 43/55 (removed 12) transitions.
[2022-05-19 17:43:39] [INFO ] Flow matrix only has 34 transitions (discarded 9 similar events)
// Phase 1: matrix 34 rows 29 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-19 17:43:39] [INFO ] Flow matrix only has 34 transitions (discarded 9 similar events)
// Phase 1: matrix 34 rows 29 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-19 17:43:39] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 17:43:39] [INFO ] Flow matrix only has 34 transitions (discarded 9 similar events)
// Phase 1: matrix 34 rows 29 cols
[2022-05-19 17:43:39] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-19 17:43:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/41 places, 43/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/41 places, 43/55 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s3 1), p0:(EQ s15 1), p1:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8810 reset in 160 ms.
Stack based approach found an accepted trace after 46 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-09 finished in 470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 41 transition count 39
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 24 transition count 39
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 24 transition count 27
Applied a total of 45 rules in 5 ms. Remains 24 /41 variables (removed 17) and now considering 27/55 (removed 28) transitions.
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 17:43:39] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:39] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:43:39] [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.
[2022-05-19 17:43:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:39] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/41 places, 27/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/41 places, 27/55 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8040 reset in 97 ms.
Stack based approach found an accepted trace after 19 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-10 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 41 transition count 39
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 24 transition count 39
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 24 transition count 27
Applied a total of 45 rules in 6 ms. Remains 24 /41 variables (removed 17) and now considering 27/55 (removed 28) transitions.
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:40] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:40] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-19 17:43:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:40] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/41 places, 27/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/41 places, 27/55 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 20 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-11 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(X(G(p1)))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-19 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s8 1), p1:(AND (EQ s19 1) (EQ s24 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 132 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 12 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-12 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))||G(p2)))'
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:40] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:41] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:41] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:41] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (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)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(OR (EQ s19 0) (EQ s22 0) (EQ s30 0)), p1:(EQ s2 0), p2:(AND (EQ s24 1) (EQ s40 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 47648 reset in 141 ms.
Product exploration explored 100000 steps with 47591 reset in 106 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 p1 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-PT-000005-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000005-LTLFireability-13 finished in 986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||p0))))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 41 transition count 39
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 24 transition count 39
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 24 transition count 27
Applied a total of 45 rules in 6 ms. Remains 24 /41 variables (removed 17) and now considering 27/55 (removed 28) transitions.
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:41] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:43:41] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 17:43:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-19 17:43:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 24 cols
[2022-05-19 17:43:42] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 17:43:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/41 places, 27/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/41 places, 27/55 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-14 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((p0 U p1)||p2)))))'
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:42] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:42] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-19 17:43:42] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-19 17:43:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 41 cols
[2022-05-19 17:43:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-19 17:43:42] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 55/55 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s19 1) (EQ s23 1) (EQ s33 1) (OR (EQ s26 0) (EQ s38 0))), p1:(AND (EQ s26 1) (EQ s38 1)), p0:(EQ s32 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 3118 reset in 225 ms.
Stack based approach found an accepted trace after 22 steps with 3 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SharedMemory-PT-000005-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000005-LTLFireability-15 finished in 552 ms.
All properties solved by simple procedures.
Total runtime 8562 ms.

BK_STOP 1652982222929

--------------------
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="SharedMemory-PT-000005"
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 SharedMemory-PT-000005, 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-165281599600660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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