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-165277016400212.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-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.7K Apr 29 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 11:31 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:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 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 14K 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-000100-LTLFireability-00
FORMULA_NAME Philosophers-COL-000100-LTLFireability-01
FORMULA_NAME Philosophers-COL-000100-LTLFireability-02
FORMULA_NAME Philosophers-COL-000100-LTLFireability-03
FORMULA_NAME Philosophers-COL-000100-LTLFireability-04
FORMULA_NAME Philosophers-COL-000100-LTLFireability-05
FORMULA_NAME Philosophers-COL-000100-LTLFireability-06
FORMULA_NAME Philosophers-COL-000100-LTLFireability-07
FORMULA_NAME Philosophers-COL-000100-LTLFireability-08
FORMULA_NAME Philosophers-COL-000100-LTLFireability-09
FORMULA_NAME Philosophers-COL-000100-LTLFireability-10
FORMULA_NAME Philosophers-COL-000100-LTLFireability-11
FORMULA_NAME Philosophers-COL-000100-LTLFireability-12
FORMULA_NAME Philosophers-COL-000100-LTLFireability-13
FORMULA_NAME Philosophers-COL-000100-LTLFireability-14
FORMULA_NAME Philosophers-COL-000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652803290163

Running Version 202205111006
[2022-05-17 16:01:31] [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 16:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:01:31] [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 16:01:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:01:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2022-05-17 16:01:32] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.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 16:01:32] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 6 ms.
[2022-05-17 16:01:32] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10097 steps, including 98 resets, run finished after 38 ms. (steps per millisecond=265 ) properties (out of 4) seen :2
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
[2022-05-17 16:01:32] [INFO ] Flatten gal took : 15 ms
[2022-05-17 16:01:32] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:01:32] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 19 ms.
[2022-05-17 16:01:32] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:32] [INFO ] Computed 200 place invariants in 19 ms
[2022-05-17 16:01:32] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:32] [INFO ] Computed 200 place invariants in 8 ms
[2022-05-17 16:01:33] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:33] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:33] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2022-05-17 16:01:33] [INFO ] Flatten gal took : 61 ms
[2022-05-17 16:01:34] [INFO ] Flatten gal took : 62 ms
[2022-05-17 16:01:34] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 2723 steps, including 0 resets, run visited all 10 properties in 83 ms. (steps per millisecond=32 )
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' '!(G(X(G(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 37 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:34] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:35] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:35] [INFO ] Computed 200 place invariants in 14 ms
[2022-05-17 16:01:35] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:35] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:35] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s75 1) (GEQ s174 1)) (AND (GEQ s6 1) (GEQ s105 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s85 1) (GEQ s18...], 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 316 steps with 0 reset in 10 ms.
FORMULA Philosophers-COL-000100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-00 finished in 1144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:36] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:36] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:36] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:36] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:36] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:36] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 1165 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-01 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 (LT s452 1) (LT s448 1) (LT s460 1) (LT s456 1) (LT s407 1) (LT s468 1) (LT s403 1) (LT s464 1) (LT s415 1) (LT s476 1) (LT s411 1) (LT s472 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 18 steps with 0 reset in 4 ms.
FORMULA Philosophers-COL-000100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-01 finished in 2115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(G(G(p0)))))||F(X(p1)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:38] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:38] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:38] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:38] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:38] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:38] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s165 1) (LT s265 1)) (OR (LT s160 1) (LT s260 1)) (OR (LT s101 1) (LT s201 1)) (OR (LT s150 1) (LT s250 1)) (OR (LT s170 1) (LT s270 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 230 reset in 1230 ms.
Stack based approach found an accepted trace after 339 steps with 0 reset with depth 340 and stack size 340 in 7 ms.
FORMULA Philosophers-COL-000100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-03 finished in 2017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:40] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:40] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:40] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-17 16:01:40] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-17 16:01:40] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:40] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:40] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-05 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 s115 1) (LT s316 1)) (OR (LT s189 1) (LT s390 1)) (OR (LT s110 1) (LT s311 1)) (OR (LT s184 1) (LT s385 1)) (OR (LT s194 1) (LT s395 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 190 reset in 887 ms.
Stack based approach found an accepted trace after 3137 steps with 6 reset with depth 362 and stack size 362 in 31 ms.
FORMULA Philosophers-COL-000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-05 finished in 1809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))&&(!p1 U G(p1))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:42] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:42] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:42] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:01:42] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-05-17 16:01:42] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:42] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:42] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s17 1) (LT s117 1)) (OR (LT s91 1) (LT s191 1)) (OR (LT s86 1) (LT s186 1)) (OR (LT s96 1) (LT s196 1)) (OR (LT s27 1) (LT s127 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1140 steps with 2 reset in 15 ms.
FORMULA Philosophers-COL-000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-06 finished in 1165 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0)))&&F(X(G(p0)))&&(p0 U X(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:43] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:43] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:43] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:43] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:43] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:43] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170 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]]
Stuttering criterion allowed to conclude after 12570 steps with 1 reset in 106 ms.
FORMULA Philosophers-COL-000100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-07 finished in 943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(G(p1)&&!(X(p1) U p2)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:44] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:44] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:44] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:44] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:44] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:44] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170...], nbAcceptance=2, 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 32982 reset in 5850 ms.
Product exploration explored 100000 steps with 33089 reset in 5880 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))))]
Knowledge based reduction with 5 factoid took 468 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:58] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:58] [INFO ] After 85ms 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 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1795 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:01] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-17 16:02:02] [INFO ] [Real]Absence check using 200 positive place invariants in 130 ms returned sat
[2022-05-17 16:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:03] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2022-05-17 16:02:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 206 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Philosophers-COL-000100-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-08 finished in 22406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U X((F((!F(p1) U !p1))&&p0))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:06] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:06] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:06] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:02:06] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:06] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:07] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), p1]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 237 reset in 839 ms.
Stack based approach found an accepted trace after 2098 steps with 3 reset with depth 207 and stack size 207 in 21 ms.
FORMULA Philosophers-COL-000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-10 finished in 1668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U !F(p1)))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:08] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:02:08] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:08] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:08] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:08] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:02:08] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 636 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], 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]]
Entered a terminal (fully accepting) state of product in 32 steps with 6 reset in 1 ms.
FORMULA Philosophers-COL-000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-11 finished in 1325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(G(p1) U X(p2)))||G(p2)||p0)))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:09] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:02:09] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:09] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:09] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:09] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:10] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 414 ms :[true, p1, p2, false, false, false, p2, false, p2, false, (AND p1 p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 8}, { cond=(AND p2 p1), acceptance={} source=7 dest: 9}], [{ cond=p2, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 10}, { cond=p2, acceptance={} source=9 dest: 11}], [{ cond=(AND p2 p1), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 10}], [{ cond=(NOT p2), acceptance={} source=11 dest: 0}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=3, aps=[p1:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-12 finished in 1105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(F(p0))) U (G(p1)||F(p0)||G(p0))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:10] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:02:10] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:10] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:10] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-17 16:02:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:10] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:11] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170 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][true, true]]
Product exploration explored 100000 steps with 33084 reset in 3428 ms.
Stack based approach found an accepted trace after 31787 steps with 10564 reset with depth 4 and stack size 4 in 1133 ms.
FORMULA Philosophers-COL-000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-13 finished in 5264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(G(p1))))||p0)))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:15] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:15] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:15] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:02:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:16] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:02:16] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1345 ms.
Product exploration explored 100000 steps with 50000 reset in 1406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 745 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-15 finished in 4449 ms.
All properties solved by simple procedures.
Total runtime 48847 ms.

BK_STOP 1652803340321

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

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