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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.1K Apr 30 10:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 10:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 09:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 09:58 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 3.7K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 12K 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-COL-000010-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652977803860

Running Version 202205111006
[2022-05-19 16:30:05] [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 16:30:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 16:30:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 16:30:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 16:30:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 610 ms
[2022-05-19 16:30:06] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 16:30:06] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 8 ms.
[2022-05-19 16:30:06] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SharedMemory-COL-000010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 56 steps, including 0 resets, run visited all 4 properties in 23 ms. (steps per millisecond=2 )
[2022-05-19 16:30:06] [INFO ] Flatten gal took : 14 ms
[2022-05-19 16:30:06] [INFO ] Flatten gal took : 1 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2022-05-19 16:30:06] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 17 ms.
[2022-05-19 16:30:06] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 10 transitions.
FORMULA SharedMemory-COL-000010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 49 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 16:30:06] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:06] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-19 16:30:06] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2022-05-19 16:30:07] [INFO ] Flatten gal took : 27 ms
[2022-05-19 16:30:07] [INFO ] Flatten gal took : 74 ms
[2022-05-19 16:30:07] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:07] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-19 16:30:08] [INFO ] After 35ms 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.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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(p1)||p0)))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 16 ms
[2022-05-19 16:30:08] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-19 16:30:08] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:08] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s1 1) (L...], 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 8 steps with 1 reset in 2 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-00 finished in 535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:08] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:08] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:08] [INFO ] Computed 21 place invariants in 20 ms
[2022-05-19 16:30:09] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 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][false, false]]
Product exploration explored 100000 steps with 31882 reset in 418 ms.
Stack based approach found an accepted trace after 35 steps with 9 reset with depth 3 and stack size 3 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-01 finished in 756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:09] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-19 16:30:09] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:09] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-19 16:30:09] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:09] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-19 16:30:09] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 237 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-COL-000010-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLFireability-02 finished in 1021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((true U !p0)&&F(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 34 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:10] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:10] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:10] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:10] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-19 16:30:10] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:10] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:10] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3338 reset in 298 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-03 finished in 772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||F(!p0)))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:11] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:11] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:11] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:11] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:11] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1)), p1:(OR (AND (GEQ s0 1) (G...], 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 3314 reset in 306 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-04 finished in 778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:12] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:12] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:12] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:12] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:12] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 207 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SharedMemory-COL-000010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLFireability-05 finished in 833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G((!p0 U p1)) U G((p2 U X(p0)))))'
Support contains 121 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:12] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:13] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:13] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:13] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-19 16:30:13] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), p1]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19301 reset in 629 ms.
Stack based approach found an accepted trace after 277 steps with 52 reset with depth 12 and stack size 12 in 2 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-06 finished in 1200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:14] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:14] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:14] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-05-19 16:30:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:14] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:14] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s9 1) (GEQ s29 1)) (A...], 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 5691 reset in 349 ms.
Stack based approach found an accepted trace after 5632 steps with 403 reset with depth 4 and stack size 4 in 19 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-07 finished in 849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(X((F(p0)&&G(p1))))))))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-19 16:30:15] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-19 16:30:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-09 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:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 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 3193 reset in 305 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 24 and stack size 24 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-09 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(X(!X(p0)))||!p1) U p0))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:15] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:15] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:15] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-10 finished in 456 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(X((X(G(p1))||p0)))))))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 25 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:16] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:16] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:16] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:16] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-19 16:30:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:16] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1)), p0:(OR (GEQ s32 1) (GEQ s...], 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 2474 reset in 339 ms.
Product exploration explored 100000 steps with 2519 reset in 339 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 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:17] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:17] [INFO ] After 22ms 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 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 21 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:18] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:18] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:18] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:18] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-05-19 16:30:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:18] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:18] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2523 reset in 312 ms.
Product exploration explored 100000 steps with 2496 reset in 307 ms.
Built C files in :
/tmp/ltsmin17693040138439375123
[2022-05-19 16:30:19] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2022-05-19 16:30:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:19] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2022-05-19 16:30:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:19] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2022-05-19 16:30:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:19] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17693040138439375123
Running compilation step : cd /tmp/ltsmin17693040138439375123;'/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 476 ms.
Running link step : cd /tmp/ltsmin17693040138439375123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 190 ms.
Running LTSmin : cd /tmp/ltsmin17693040138439375123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5466403186700523496.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:34] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:34] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:34] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-19 16:30:34] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-05-19 16:30:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:35] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:35] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin13238371757525915562
[2022-05-19 16:30:35] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2022-05-19 16:30:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:35] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2022-05-19 16:30:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:35] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2022-05-19 16:30:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:30:35] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13238371757525915562
Running compilation step : cd /tmp/ltsmin13238371757525915562;'/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 373 ms.
Running link step : cd /tmp/ltsmin13238371757525915562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13238371757525915562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16742919891807227738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 16:30:50] [INFO ] Flatten gal took : 9 ms
[2022-05-19 16:30:50] [INFO ] Flatten gal took : 9 ms
[2022-05-19 16:30:50] [INFO ] Time to serialize gal into /tmp/LTL10049580271274755117.gal : 3 ms
[2022-05-19 16:30:50] [INFO ] Time to serialize properties into /tmp/LTL18313139078971145789.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10049580271274755117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18313139078971145789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1004958...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(X(((((X(G("(((((Active_2>=1)||(Active_3>=1))||((Active_4>=1)||(Active_5>=1)))||(((Active_6>=1)||(Active_7>=1))||((Active_9>...401
Formula 0 simplified : !GFGFX("(((Active_5>=1)||(Active_6>=1))||((Active_7>=1)||(Active_9>=1)))" | "(((Active_8>=1)||(Active_0>=1))||(Active_1>=1))" | "((A...375
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
161 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.65597,71132,1,0,9,243273,46,1,4035,89730,34
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000010-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SharedMemory-COL-000010-LTLFireability-11 finished in 36081 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 90 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:52] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:52] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 16:30:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s122 1) (GEQ s63 1) (GEQ s126 1) (GEQ s67 1) (GEQ s70 1) (GEQ s74 1) (GEQ s78 1) (GEQ s81 1) (GEQ s85 1) (GEQ s89 1) (GEQ s92 1) (GEQ s96 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 690 ms.
Stack based approach found an accepted trace after 233 steps with 0 reset with depth 234 and stack size 209 in 2 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-12 finished in 995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !X(F(X((p0 U p1))))))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:53] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:53] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:53] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-19 16:30:53] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:53] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:53] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1)), p1:(OR (AND (GEQ s15 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2512 reset in 939 ms.
Stack based approach found an accepted trace after 244 steps with 5 reset with depth 4 and stack size 4 in 3 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-13 finished in 1341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:54] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:54] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:54] [INFO ] Computed 21 place invariants in 14 ms
[2022-05-19 16:30:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 131 cols
[2022-05-19 16:30:54] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-19 16:30:54] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-14 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 (GEQ s122 1) (GEQ s63 1) (GEQ s126 1) (GEQ s67 1) (GEQ s70 1) (GEQ s74 1) (GEQ s78 1) (GEQ s81 1) (GEQ s85 1) (GEQ s89 1) (GEQ s92 1) (GEQ s96 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 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-14 finished in 327 ms.
All properties solved by simple procedures.
Total runtime 49655 ms.

BK_STOP 1652977854959

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

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