Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995800005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995800005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.9K May 5 16:51 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-000010-00
FORMULA_NAME Philosophers-COL-000010-01
FORMULA_NAME Philosophers-COL-000010-02
FORMULA_NAME Philosophers-COL-000010-03
FORMULA_NAME Philosophers-COL-000010-04
FORMULA_NAME Philosophers-COL-000010-05
FORMULA_NAME Philosophers-COL-000010-06
FORMULA_NAME Philosophers-COL-000010-07
FORMULA_NAME Philosophers-COL-000010-08
FORMULA_NAME Philosophers-COL-000010-09
FORMULA_NAME Philosophers-COL-000010-10
FORMULA_NAME Philosophers-COL-000010-11
FORMULA_NAME Philosophers-COL-000010-12
FORMULA_NAME Philosophers-COL-000010-13
FORMULA_NAME Philosophers-COL-000010-14
FORMULA_NAME Philosophers-COL-000010-15

=== Now, execution of the tool begins

BK_START 1622990102133

Running Version 0
[2021-06-06 14:35:09] [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]
[2021-06-06 14:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:09] [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.
[2021-06-06 14:35:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:35:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1538 ms
[2021-06-06 14:35:10] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:11] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 19 ms.
[2021-06-06 14:35:11] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_8012762794288159928.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2021-06-06 14:35:11] [INFO ] Flatten gal took : 37 ms
[2021-06-06 14:35:11] [INFO ] Flatten gal took : 3 ms
[2021-06-06 14:35:11] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 6 ms.
[2021-06-06 14:35:11] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7571166772682613777.dot
[2021-06-06 14:35:11] [INFO ] Initial state test concluded for 5 properties.
FORMULA Philosophers-COL-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 15 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 13 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:12] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
[2021-06-06 14:35:12] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 14:35:12] [INFO ] Flatten gal took : 79 ms
FORMULA Philosophers-COL-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 14:35:12] [INFO ] Flatten gal took : 34 ms
[2021-06-06 14:35:12] [INFO ] Input system was already deterministic with 50 transitions.
Incomplete random walk after 100000 steps, including 695 resets, run finished after 1005 ms. (steps per millisecond=99 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:13] [INFO ] Computed 20 place invariants in 7 ms
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 23 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:14] [INFO ] Computed 20 place invariants in 4 ms
[2021-06-06 14:35:14] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:14] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:14] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2021-06-06 14:35:14] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:14] [INFO ] Computed 20 place invariants in 12 ms
[2021-06-06 14:35:14] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (LT s49 1) (LT s48 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1)) (AND (OR (LT s11 1) (LT s21 1)) (OR (LT s15 1) (LT s25 1)) (OR (LT s19 1) (LT s29 1)) (OR (LT s13 1) (LT s23 1)) (OR (LT s17 1) (LT s27 1)) (OR (LT s10 1) (LT s20 1)) (OR (LT s12 1) (LT s22 1)) (OR (LT s14 1) (LT s24 1)) (OR (LT s16 1) (LT s26 1)) (OR (LT s18 1) (LT s28 1)))), p0:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3177 steps with 19 reset in 128 ms.
FORMULA Philosophers-COL-000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-01 finished in 1373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:15] [INFO ] Computed 20 place invariants in 4 ms
[2021-06-06 14:35:15] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:15] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:15] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2021-06-06 14:35:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:15] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1))), p0:(OR (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s13 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s37 1)) (AND (GEQ s17 1) (GEQ s38 1)) (AND (GEQ s12 1) (GEQ s33 1)) (AND (GEQ s14 1) (GEQ s35 1)) (AND (GEQ s15 1) (GEQ s36 1)) (AND (GEQ s18 1) (GEQ s39 1)) (AND (GEQ s10 1) (GEQ s31 1)) (AND (GEQ s11 1) (GEQ s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28759 reset in 716 ms.
Stack based approach found an accepted trace after 359 steps with 111 reset with depth 8 and stack size 8 in 24 ms.
FORMULA Philosophers-COL-000010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-02 finished in 1547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:16] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:17] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2021-06-06 14:35:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:17] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-03 automaton TGBA [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 s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT s14 1) (LT s35 1)) (OR (LT s15 1) (LT s36 1)) (OR (LT s18 1) (LT s39 1)) (OR (LT s10 1) (LT s31 1)) (OR (LT s11 1) (LT s32 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 8236 reset in 558 ms.
Stack based approach found an accepted trace after 217 steps with 16 reset with depth 15 and stack size 15 in 1 ms.
FORMULA Philosophers-COL-000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-03 finished in 1077 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:18] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:18] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:18] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:18] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:18] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1))), p1:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1)) (AND (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s22 1)) (AND (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s16 1) (GEQ s26 1)) (AND (GEQ s18 1) (GEQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1549 steps with 367 reset in 7 ms.
FORMULA Philosophers-COL-000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-04 finished in 972 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:18] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:18] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:18] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-06 14:35:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2021-06-06 14:35:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:19] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s12 1)) (AND (GEQ s3 1) (GEQ s13 1)) (AND (GEQ s4 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-05 finished in 478 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F((p0||(p1 U (p2||G(p1))))))||(F(((p1 U (p2||G(p1)))||X(p0)))&&p3))))], workingDir=/home/mcc/execution]
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:19] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:19] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:19] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-07 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p2) p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(AND (OR (LT s11 1) (LT s21 1)) (OR (LT s15 1) (LT s25 1)) (OR (LT s19 1) (LT s29 1)) (OR (LT s13 1) (LT s23 1)) (OR (LT s17 1) (LT s27 1)) (OR (LT s10 1) (LT s20 1)) (OR (LT s12 1) (LT s22 1)) (OR (LT s14 1) (LT s24 1)) (OR (LT s16 1) (LT s26 1)) (OR (LT s18 1) (LT s28 1))), p0:(AND (OR (LT s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT s14 1) (LT s35 1)) (OR (LT s15 1) (LT s36 1)) (OR (LT s18 1) (LT s39 1)) (OR (LT s10 1) (LT s31 1)) (OR (LT s11 1) (LT s32 1))), p2:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1)) (OR (LT s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT s14 1) (LT s35 1)) (OR (LT s15 1) (LT s36 1)) (OR (LT s18 1) (LT s39 1)) (OR (LT s10 1) (LT s31 1)) (OR (LT s11 1) (LT s32 1))), p1:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15133 reset in 602 ms.
Stack based approach found an accepted trace after 18 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Philosophers-COL-000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-07 finished in 966 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((X(!p1)||p0)) U X(G(!p2))))], workingDir=/home/mcc/execution]
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:20] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:20] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:20] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:20] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:20] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 188 ms :[p2, (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000010-08 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1)), p0:(OR (AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1))) (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s13 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s37 1)) (AND (GEQ s17 1) (GEQ s38 1)) (AND (GEQ s12 1) (GEQ s33 1)) (AND (GEQ s14 1) (GEQ s35 1)) (AND (GEQ s15 1) (GEQ s36 1)) (AND (GEQ s18 1) (GEQ s39 1)) (AND (GEQ s10 1) (GEQ s31 1)) (AND (GEQ s11 1) (GEQ s32 1))), p1:(AND (OR (LT s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT s14 1) (LT s35 1)) (OR (LT s15 1) (LT s36 1)) (OR (LT s18 1) (LT s39 1)) (OR (LT s10 1) (LT s31 1)) (OR (LT s11 1) (LT s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12319 reset in 612 ms.
Stack based approach found an accepted trace after 13 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Philosophers-COL-000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-08 finished in 1203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:21] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:21] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:21] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:21] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:21] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:21] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, p0, p0, p0]
Running random walk in product with property : Philosophers-COL-000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-09 finished in 537 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2021-06-06 14:35:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LT s49 1) (LT s48 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1) (OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s12 1)) (AND (GEQ s3 1) (GEQ s13 1)) (AND (GEQ s4 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s15 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-10 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000010-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-12 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:22] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2021-06-06 14:35:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:23] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Philosophers-COL-000010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (LT s13 1)) (OR (LT s6 1) (LT s15 1)) (OR (LT s7 1) (LT s16 1)) (OR (LT s8 1) (LT s17 1)) (OR (LT s9 1) (LT s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 241 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-14 finished in 326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:23] [INFO ] Computed 20 place invariants in 17 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2021-06-06 14:35:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:23] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:23] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s19 1) (LT s30 1)) (OR (LT s13 1) (LT s34 1)) (OR (LT s16 1) (LT s37 1)) (OR (LT s17 1) (LT s38 1)) (OR (LT s12 1) (LT s33 1)) (OR (LT s14 1) (LT s35 1)) (OR (LT s15 1) (LT s36 1)) (OR (LT s18 1) (LT s39 1)) (OR (LT s10 1) (LT s31 1)) (OR (LT s11 1) (LT s32 1)) (OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s12 1)) (AND (GEQ s3 1) (GEQ s13 1)) (AND (GEQ s4 1) (GEQ s14 1)) (AND (GEQ s5 1) (GEQ s15 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-15 finished in 334 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990124778

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162298995800005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;