Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016300180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 Philosophers-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016300180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:25 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 9.7K 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 Philosophers-COL-000005-LTLFireability-00
FORMULA_NAME Philosophers-COL-000005-LTLFireability-01
FORMULA_NAME Philosophers-COL-000005-LTLFireability-02
FORMULA_NAME Philosophers-COL-000005-LTLFireability-03
FORMULA_NAME Philosophers-COL-000005-LTLFireability-04
FORMULA_NAME Philosophers-COL-000005-LTLFireability-05
FORMULA_NAME Philosophers-COL-000005-LTLFireability-06
FORMULA_NAME Philosophers-COL-000005-LTLFireability-07
FORMULA_NAME Philosophers-COL-000005-LTLFireability-08
FORMULA_NAME Philosophers-COL-000005-LTLFireability-09
FORMULA_NAME Philosophers-COL-000005-LTLFireability-10
FORMULA_NAME Philosophers-COL-000005-LTLFireability-11
FORMULA_NAME Philosophers-COL-000005-LTLFireability-12
FORMULA_NAME Philosophers-COL-000005-LTLFireability-13
FORMULA_NAME Philosophers-COL-000005-LTLFireability-14
FORMULA_NAME Philosophers-COL-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652801274698

Running Version 202205111006
[2022-05-17 15:27:55] [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-17 15:27:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 15:27:55] [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-17 15:27:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 15:27:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 508 ms
[2022-05-17 15:27:56] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 15:27:56] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2022-05-17 15:27:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000005-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 22 steps, including 3 resets, run visited all 3 properties in 7 ms. (steps per millisecond=3 )
[2022-05-17 15:27:56] [INFO ] Flatten gal took : 13 ms
[2022-05-17 15:27:56] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5) 5) 5)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 15:27:56] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions 80 arcs in 6 ms.
[2022-05-17 15:27:56] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000005-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:56] [INFO ] Computed 10 place invariants in 12 ms
[2022-05-17 15:27:56] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:56] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 15:27:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:57] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 15:27:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2022-05-17 15:27:57] [INFO ] Flatten gal took : 7 ms
[2022-05-17 15:27:57] [INFO ] Flatten gal took : 6 ms
[2022-05-17 15:27:57] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 12 properties in 6 ms. (steps per millisecond=1 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:57] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 15:27:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-17 15:27:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:57] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 15:27:57] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1))), ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 5 ms.
FORMULA Philosophers-COL-000005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-00 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-02 finished in 301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-17 15:27:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-03 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:(AND (OR (LT s4 1) (LT s8 1)) (OR (LT s1 1) (LT s5 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s9 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 15734 reset in 249 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-03 finished in 451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U !X((F(p1)||p2))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:27:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR p2 p1), (OR p2 p1), (AND (NOT p1) p2), (OR p2 p1), true, p1, (NOT p1), p1]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 2}, { cond=(OR p1 (AND p0 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-04 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:59] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 15:27:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-17 15:27:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 57 steps with 12 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-07 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:59] [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.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:27:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-08 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:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s4 1) (LT s9 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-08 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(G((p0 U p1))))||X(!p0)||G(p2)))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 15:27:59] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:27:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:27:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:27:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(OR p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s4 1) (LT s9 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1))), p0:(OR (AND (GEQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 131 steps with 20 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-09 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((((p2 U X(p3)) U p4)||p1)))||p0)))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) p2), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p4) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p4) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) p2), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p1 (NOT p2) (NOT p3)) (AND (NOT p0) p4 (NOT p2) (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1 p2 (NOT p3)) (AND (NOT p0) p4 p2 (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)), p1:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 20 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-10 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((G(p1)||p0)) U p2))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-17 15:28:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, p1, (OR p0 p1), p2, (AND p1 p2), (OR (AND p0 p2) (AND p1 p2))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s9 1)) (AND (G...], 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, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 14671 reset in 247 ms.
Stack based approach found an accepted trace after 428 steps with 63 reset with depth 7 and stack size 7 in 2 ms.
FORMULA Philosophers-COL-000005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-11 finished in 567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-17 15:28:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:00] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-17 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-12 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:(OR (AND (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s9 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]]
Stuttering criterion allowed to conclude after 42 steps with 2 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-12 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(p1)||G(p2))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)) (OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s5 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-13 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(!G(F(X(p1))))))||F(X(G(p0))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-17 15:28:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1))), p0:(O...], nbAcceptance=2, 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 2799 reset in 234 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-14 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(p0 U p1)||G(X(!p1))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2022-05-17 15:28:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 15:28:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 399 ms :[true, p1, p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1)), p1:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s1 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLFireability-15 finished in 515 ms.
All properties solved by simple procedures.
Total runtime 6361 ms.

BK_STOP 1652801282305

--------------------
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="Philosophers-COL-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 Philosophers-COL-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 r168-tall-165277016300180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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