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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 13:10 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.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K Feb 25 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 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 14K 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-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 1678790203975

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-000100
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-14 10:36:45] [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 10:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:36:45] [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 10:36:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 10:36:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2023-03-14 10:36:46] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 10:36:46] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 10:36:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 3368 steps, including 33 resets, run visited all 4 properties in 15 ms. (steps per millisecond=224 )
[2023-03-14 10:36:46] [INFO ] Flatten gal took : 18 ms
[2023-03-14 10:36:46] [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
[2023-03-14 10:36:46] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 26 ms.
[2023-03-14 10:36:46] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLFireability-11 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
[2023-03-14 10:36:46] [INFO ] Computed 200 place invariants in 24 ms
[2023-03-14 10:36:46] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-14 10:36:46] [INFO ] Invariant cache hit.
[2023-03-14 10:36:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-14 10:36:47] [INFO ] Invariant cache hit.
[2023-03-14 10:36:47] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 972 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2023-03-14 10:36:47] [INFO ] Flatten gal took : 141 ms
[2023-03-14 10:36:48] [INFO ] Flatten gal took : 54 ms
[2023-03-14 10:36:48] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 1445 steps, including 0 resets, run visited all 12 properties in 57 ms. (steps per millisecond=25 )
FORMULA Philosophers-COL-000100-LTLFireability-10 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' '!(X(X((G(p0) U 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 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:36:48] [INFO ] Invariant cache hit.
[2023-03-14 10:36:49] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-14 10:36:49] [INFO ] Invariant cache hit.
[2023-03-14 10:36:49] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-14 10:36:49] [INFO ] Invariant cache hit.
[2023-03-14 10:36:49] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=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, 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 2188 ms.
Product exploration explored 100000 steps with 33333 reset in 2218 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 (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 105 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-000100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-00 finished in 6275 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 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 43 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:36:55] [INFO ] Invariant cache hit.
[2023-03-14 10:36:55] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-14 10:36:55] [INFO ] Invariant cache hit.
[2023-03-14 10:36:55] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-14 10:36:55] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-14 10:36:55] [INFO ] Invariant cache hit.
[2023-03-14 10:36:55] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 804 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-02 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 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5 reset in 797 ms.
Stack based approach found an accepted trace after 633 steps with 0 reset with depth 634 and stack size 634 in 11 ms.
FORMULA Philosophers-COL-000100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-02 finished in 1677 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 U !p1)||G((G((G(p3) U p0))||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 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:36:56] [INFO ] Invariant cache hit.
[2023-03-14 10:36:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-14 10:36:56] [INFO ] Invariant cache hit.
[2023-03-14 10:36:57] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-14 10:36:57] [INFO ] Invariant cache hit.
[2023-03-14 10:36:57] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), true, (NOT p3), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 p2)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=(OR p0 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=7 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(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-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1397 steps with 1 reset in 37 ms.
FORMULA Philosophers-COL-000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-03 finished in 1139 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((F(G(p0))||G((!p0 U p1)))))'
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 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:36:57] [INFO ] Invariant cache hit.
[2023-03-14 10:36:58] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-14 10:36:58] [INFO ] Invariant cache hit.
[2023-03-14 10:36:58] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-14 10:36:58] [INFO ] Invariant cache hit.
[2023-03-14 10:36:58] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-05 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), 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}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(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, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 880 ms.
Stack based approach found an accepted trace after 1246 steps with 0 reset with depth 1247 and stack size 1246 in 12 ms.
FORMULA Philosophers-COL-000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-05 finished in 1841 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((F((G(F(p1))||(X(p1)&&p2)))||p0)))'
Support contains 400 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 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:36:59] [INFO ] Invariant cache hit.
[2023-03-14 10:36:59] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-14 10:36:59] [INFO ] Invariant cache hit.
[2023-03-14 10:37:00] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-14 10:37:00] [INFO ] Invariant cache hit.
[2023-03-14 10:37:00] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, 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, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 388 reset in 972 ms.
Stack based approach found an accepted trace after 1157 steps with 6 reset with depth 471 and stack size 471 in 14 ms.
FORMULA Philosophers-COL-000100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-06 finished in 1919 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(p0))||G((X(!p2)||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 5 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:01] [INFO ] Invariant cache hit.
[2023-03-14 10:37:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-14 10:37:01] [INFO ] Invariant cache hit.
[2023-03-14 10:37:02] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-14 10:37:02] [INFO ] Invariant cache hit.
[2023-03-14 10:37:02] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}]], initial=5, aps=[p1:(OR (AND (GEQ s115 1) (GEQ s316 1)) (AND (GEQ s189 1) (GEQ s390 1)) (AND (GEQ s110 1) (GEQ s311 1)) (AND (GEQ s184 1) (GEQ s385 1)) (AND (GEQ s194 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3929 ms.
Product exploration explored 100000 steps with 33333 reset in 4011 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 p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p2) (NOT p0)))))
Knowledge based reduction with 8 factoid took 281 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-07 finished in 10606 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 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 19 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:12] [INFO ] Invariant cache hit.
[2023-03-14 10:37:12] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-14 10:37:12] [INFO ] Invariant cache hit.
[2023-03-14 10:37:12] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-14 10:37:12] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 10:37:12] [INFO ] Invariant cache hit.
[2023-03-14 10:37:12] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 731 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-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 (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) (GE...], 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 19327 steps with 0 reset in 228 ms.
FORMULA Philosophers-COL-000100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-09 finished in 1014 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)||X(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 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:13] [INFO ] Invariant cache hit.
[2023-03-14 10:37:13] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-14 10:37:13] [INFO ] Invariant cache hit.
[2023-03-14 10:37:13] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-14 10:37:13] [INFO ] Invariant cache hit.
[2023-03-14 10:37:13] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33150 reset in 3058 ms.
Product exploration explored 100000 steps with 33109 reset in 3138 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))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p1), (AND p0 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 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:21] [INFO ] Invariant cache hit.
[2023-03-14 10:37:21] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-14 10:37:21] [INFO ] Invariant cache hit.
[2023-03-14 10:37:21] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-14 10:37:21] [INFO ] Invariant cache hit.
[2023-03-14 10:37:21] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p1), (AND p0 p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 33233 reset in 2667 ms.
Product exploration explored 100000 steps with 32986 reset in 2749 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 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 26 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 10:37:28] [INFO ] Invariant cache hit.
[2023-03-14 10:37:28] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin5839420603362186807
[2023-03-14 10:37:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5839420603362186807
Running compilation step : cd /tmp/ltsmin5839420603362186807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 895 ms.
Running link step : cd /tmp/ltsmin5839420603362186807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5839420603362186807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15858672979085064993.hoa' '--buchi-type=spotba'
LTSmin run took 674 ms.
FORMULA Philosophers-COL-000100-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000100-LTLFireability-13 finished in 17054 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((X(!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 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:30] [INFO ] Invariant cache hit.
[2023-03-14 10:37:30] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-14 10:37:30] [INFO ] Invariant cache hit.
[2023-03-14 10:37:30] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-14 10:37:30] [INFO ] Invariant cache hit.
[2023-03-14 10:37:31] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 39 reset in 639 ms.
Stack based approach found an accepted trace after 1068 steps with 0 reset with depth 1069 and stack size 1069 in 9 ms.
FORMULA Philosophers-COL-000100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-14 finished in 1489 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((F((!p0&&X(p1))) U X(!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 10 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 10:37:31] [INFO ] Invariant cache hit.
[2023-03-14 10:37:31] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-14 10:37:31] [INFO ] Invariant cache hit.
[2023-03-14 10:37:32] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-14 10:37:32] [INFO ] Invariant cache hit.
[2023-03-14 10:37:32] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), p0, p0, p0, p0, (OR (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 0}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=1, 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, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7102 reset in 961 ms.
Stack based approach found an accepted trace after 752 steps with 191 reset with depth 180 and stack size 180 in 15 ms.
FORMULA Philosophers-COL-000100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-15 finished in 1989 ms.
All properties solved by simple procedures.
Total runtime 48359 ms.

BK_STOP 1678790254606

--------------------
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-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-5348"
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 r293-tall-167873945000116"
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 ;