Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945000100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Philosophers-COL-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945000100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:23 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-000020-LTLFireability-00
FORMULA_NAME Philosophers-COL-000020-LTLFireability-01
FORMULA_NAME Philosophers-COL-000020-LTLFireability-02
FORMULA_NAME Philosophers-COL-000020-LTLFireability-03
FORMULA_NAME Philosophers-COL-000020-LTLFireability-04
FORMULA_NAME Philosophers-COL-000020-LTLFireability-05
FORMULA_NAME Philosophers-COL-000020-LTLFireability-06
FORMULA_NAME Philosophers-COL-000020-LTLFireability-07
FORMULA_NAME Philosophers-COL-000020-LTLFireability-08
FORMULA_NAME Philosophers-COL-000020-LTLFireability-09
FORMULA_NAME Philosophers-COL-000020-LTLFireability-10
FORMULA_NAME Philosophers-COL-000020-LTLFireability-11
FORMULA_NAME Philosophers-COL-000020-LTLFireability-12
FORMULA_NAME Philosophers-COL-000020-LTLFireability-13
FORMULA_NAME Philosophers-COL-000020-LTLFireability-14
FORMULA_NAME Philosophers-COL-000020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678787685060

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-14 09:54:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 09:54:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:54:46] [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.
[2023-03-14 09:54:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:54:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1396 ms
[2023-03-14 09:54:47] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:54:48] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-14 09:54:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 90 steps, including 4 resets, run visited all 3 properties in 7 ms. (steps per millisecond=12 )
[2023-03-14 09:54:48] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:54:48] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:54:48] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 10 ms.
[2023-03-14 09:54:48] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000020-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2023-03-14 09:54:48] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-14 09:54:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-14 09:54:48] [INFO ] Invariant cache hit.
[2023-03-14 09:54:48] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-14 09:54:48] [INFO ] Invariant cache hit.
[2023-03-14 09:54:48] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2023-03-14 09:54:48] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:54:48] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:54:48] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=1 )
FORMULA Philosophers-COL-000020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:49] [INFO ] Invariant cache hit.
[2023-03-14 09:54:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-14 09:54:49] [INFO ] Invariant cache hit.
[2023-03-14 09:54:49] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-14 09:54:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:49] [INFO ] Invariant cache hit.
[2023-03-14 09:54:49] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s29 1) (LT s49 1)) (OR (LT s37 1) (LT s57 1)) (OR (LT s21 1) (LT s41 1)) (OR (LT s22 1) (LT s42 1)) (OR (LT s24 1) (LT s44 1)) (OR (LT s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1300 reset in 401 ms.
Stack based approach found an accepted trace after 94 steps with 2 reset with depth 56 and stack size 56 in 1 ms.
FORMULA Philosophers-COL-000020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-00 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-14 09:54:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s36 1) (LT s77 1)) (OR (LT s20 1) (LT s61 1)) (OR (LT s28 1) (LT s69 1)) (OR (LT s29 1) (LT s70 1)) (OR (LT s31 1) (LT s72 1)) (OR (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 159 reset in 304 ms.
Stack based approach found an accepted trace after 189 steps with 0 reset with depth 190 and stack size 190 in 1 ms.
FORMULA Philosophers-COL-000020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-01 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(X(F(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s13 1) (GEQ s33 1)) (AND (GEQ s16 1) (GEQ s36 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 365 ms.
Product exploration explored 100000 steps with 33333 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000020-LTLFireability-02 finished in 1285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:51] [INFO ] Invariant cache hit.
[2023-03-14 09:54:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-14 09:54:51] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-14 09:54:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s36 1) (LT s77 1)) (OR (LT s20 1) (LT s61 1)) (OR (LT s28 1) (LT s69 1)) (OR (LT s29 1) (LT s70 1)) (OR (LT s31 1) (LT s72 1)) (OR (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35214 steps with 11072 reset in 156 ms.
FORMULA Philosophers-COL-000020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-03 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-14 09:54:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s13 1) (GEQ s33 1)) (AND (GEQ s16 1) (GEQ s36 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 119 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-04 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (((!p0 U G(p2))||X(!p2)||p1) U !p3)))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-14 09:54:52] [INFO ] Invariant cache hit.
[2023-03-14 09:54:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 308 ms :[p3, p3, false, p2, false, true, (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p1) p2 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=p2, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (OR (LT s36 1) (LT s77 1)) (OR (LT s20 1) (LT s61 1)) (OR (LT s28 1) (LT s69 1)) (OR (LT s29 1) (LT s70 1)) (OR (LT s31 1) (LT s72 1)) (OR (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2335 steps with 734 reset in 26 ms.
FORMULA Philosophers-COL-000020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-06 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-14 09:54:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s36 1) (LT s77 1)) (OR (LT s20 1) (LT s61 1)) (OR (LT s28 1) (LT s69 1)) (OR (LT s29 1) (LT s70 1)) (OR (LT s31 1) (LT s72 1)) (OR (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 161 reset in 322 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 1 ms.
FORMULA Philosophers-COL-000020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-09 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-14 09:54:53] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s13 1) (GEQ s33 1)) (AND (GEQ s16 1) (GEQ s36 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-10 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(((X(p0) U p1)||G(p0))))))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-14 09:54:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s29 1) (GEQ s49 1)) (AND (GEQ s37 1) (GEQ s57 1)) (AND (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s42 1)) (AND (GEQ s24 1) (GEQ s44 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2120 steps with 11 reset in 10 ms.
FORMULA Philosophers-COL-000020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-13 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U p1)&&F(G((!p0 U p1))))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-14 09:54:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 09:54:54] [INFO ] Invariant cache hit.
[2023-03-14 09:54:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s13 1) (GEQ s33 1)) (AND (GEQ s16 1) (GEQ s36 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 954 steps with 23 reset in 13 ms.
FORMULA Philosophers-COL-000020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLFireability-15 finished in 281 ms.
All properties solved by simple procedures.
Total runtime 8125 ms.

BK_STOP 1678787698323

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-000020"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000020, 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 r293-tall-167873945000100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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