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.r295-tall-167873947400108.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 lolaxred
Input is Philosophers-COL-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.6K 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 15K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:15 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 12K 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-000050-LTLFireability-00
FORMULA_NAME Philosophers-COL-000050-LTLFireability-01
FORMULA_NAME Philosophers-COL-000050-LTLFireability-02
FORMULA_NAME Philosophers-COL-000050-LTLFireability-03
FORMULA_NAME Philosophers-COL-000050-LTLFireability-04
FORMULA_NAME Philosophers-COL-000050-LTLFireability-05
FORMULA_NAME Philosophers-COL-000050-LTLFireability-06
FORMULA_NAME Philosophers-COL-000050-LTLFireability-07
FORMULA_NAME Philosophers-COL-000050-LTLFireability-08
FORMULA_NAME Philosophers-COL-000050-LTLFireability-09
FORMULA_NAME Philosophers-COL-000050-LTLFireability-10
FORMULA_NAME Philosophers-COL-000050-LTLFireability-11
FORMULA_NAME Philosophers-COL-000050-LTLFireability-12
FORMULA_NAME Philosophers-COL-000050-LTLFireability-13
FORMULA_NAME Philosophers-COL-000050-LTLFireability-14
FORMULA_NAME Philosophers-COL-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678782822858

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:33: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 08:33:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:33:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 402 ms
[2023-03-14 08:33:45] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 17 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 08:33:46] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 6 ms.
[2023-03-14 08:33:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 5618 steps, including 108 resets, run visited all 7 properties in 23 ms. (steps per millisecond=244 )
[2023-03-14 08:33:46] [INFO ] Flatten gal took : 13 ms
[2023-03-14 08:33:46] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:33:46] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 14 ms.
[2023-03-14 08:33:46] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-14 08:33:46] [INFO ] Computed 100 place invariants in 19 ms
[2023-03-14 08:33:46] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-14 08:33:46] [INFO ] Invariant cache hit.
[2023-03-14 08:33:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-03-14 08:33:46] [INFO ] Invariant cache hit.
[2023-03-14 08:33:47] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2023-03-14 08:33:47] [INFO ] Flatten gal took : 46 ms
[2023-03-14 08:33:47] [INFO ] Flatten gal took : 33 ms
[2023-03-14 08:33:47] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 182 steps, including 0 resets, run visited all 11 properties in 18 ms. (steps per millisecond=10 )
FORMULA Philosophers-COL-000050-LTLFireability-09 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:47] [INFO ] Invariant cache hit.
[2023-03-14 08:33:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 08:33:47] [INFO ] Invariant cache hit.
[2023-03-14 08:33:47] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-14 08:33:47] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 08:33:48] [INFO ] Invariant cache hit.
[2023-03-14 08:33:48] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 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 83716 steps with 93 reset in 466 ms.
FORMULA Philosophers-COL-000050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-00 finished in 1110 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((X((F(!p1)||G(p2)))&&p0))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:48] [INFO ] Invariant cache hit.
[2023-03-14 08:33:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 08:33:48] [INFO ] Invariant cache hit.
[2023-03-14 08:33:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-14 08:33:49] [INFO ] Invariant cache hit.
[2023-03-14 08:33:49] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s34 1) (LT s83 1)) (OR (LT s39 1) (LT s88 1)) (OR (LT s29 1) (LT s78 1)) (OR (LT s2 1) (LT s51 1)) (OR (LT s7 1) (LT s56 1)) (OR (LT s24 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 269 reset in 662 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-01 finished in 1255 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 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:50] [INFO ] Invariant cache hit.
[2023-03-14 08:33:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-14 08:33:50] [INFO ] Invariant cache hit.
[2023-03-14 08:33:50] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-14 08:33:50] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 08:33:50] [INFO ] Invariant cache hit.
[2023-03-14 08:33:50] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], 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 21 reset in 421 ms.
Stack based approach found an accepted trace after 126 steps with 0 reset with depth 127 and stack size 127 in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-02 finished in 998 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 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:51] [INFO ] Invariant cache hit.
[2023-03-14 08:33:51] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-14 08:33:51] [INFO ] Invariant cache hit.
[2023-03-14 08:33:51] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-14 08:33:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 08:33:51] [INFO ] Invariant cache hit.
[2023-03-14 08:33:51] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 982 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-03 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 s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], 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 1133 steps with 0 reset in 9 ms.
FORMULA Philosophers-COL-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 1381 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)||G(p1)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:52] [INFO ] Invariant cache hit.
[2023-03-14 08:33:52] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-14 08:33:52] [INFO ] Invariant cache hit.
[2023-03-14 08:33:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-14 08:33:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:33:52] [INFO ] Invariant cache hit.
[2023-03-14 08:33:52] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s50 1) (LT s100 1)) (OR (LT s87 1) (LT s137 1)) (OR (LT s82 1) (LT s132 1)) (OR (LT s92 1) (LT s142 1)) (OR (LT s60 1) (LT s110 1)) (OR (L...], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-04 finished in 480 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(F((G(F(!p1))||(X(F(!p1))&&p2))))))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:52] [INFO ] Invariant cache hit.
[2023-03-14 08:33:53] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-14 08:33:53] [INFO ] Invariant cache hit.
[2023-03-14 08:33:53] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-14 08:33:53] [INFO ] Invariant cache hit.
[2023-03-14 08:33:53] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], 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 25822 reset in 884 ms.
Stack based approach found an accepted trace after 446 steps with 125 reset with depth 83 and stack size 83 in 5 ms.
FORMULA Philosophers-COL-000050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-05 finished in 1461 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(G(p0)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:54] [INFO ] Invariant cache hit.
[2023-03-14 08:33:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-14 08:33:54] [INFO ] Invariant cache hit.
[2023-03-14 08:33:54] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-14 08:33:54] [INFO ] Invariant cache hit.
[2023-03-14 08:33:54] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s63 1)) (AND (GEQ s8 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s68 1)) (AND (GEQ s40 1) (GEQ s90 1)) (AND (GEQ s28 1) (GEQ s78 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 245 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-08 finished in 429 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 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:54] [INFO ] Invariant cache hit.
[2023-03-14 08:33:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-14 08:33:54] [INFO ] Invariant cache hit.
[2023-03-14 08:33:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-14 08:33:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:33:55] [INFO ] Invariant cache hit.
[2023-03-14 08:33:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], 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]]
Product exploration explored 100000 steps with 32758 reset in 989 ms.
Stack based approach found an accepted trace after 1233 steps with 407 reset with depth 4 and stack size 4 in 13 ms.
FORMULA Philosophers-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-10 finished in 1400 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 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:33:56] [INFO ] Invariant cache hit.
[2023-03-14 08:33:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-14 08:33:56] [INFO ] Invariant cache hit.
[2023-03-14 08:33:56] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-14 08:33:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 08:33:56] [INFO ] Invariant cache hit.
[2023-03-14 08:33:56] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], 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]]
Product exploration explored 100000 steps with 33371 reset in 1110 ms.
Product exploration explored 100000 steps with 33185 reset in 1150 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 08:33:59] [INFO ] Invariant cache hit.
[2023-03-14 08:33:59] [INFO ] [Real]Absence check using 100 positive place invariants in 48 ms returned sat
[2023-03-14 08:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:34:00] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-14 08:34:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:34:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 58 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 286 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000050-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-11 finished in 4955 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(X(F(!p0)))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:34:01] [INFO ] Invariant cache hit.
[2023-03-14 08:34:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-14 08:34:01] [INFO ] Invariant cache hit.
[2023-03-14 08:34:01] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-14 08:34:01] [INFO ] Invariant cache hit.
[2023-03-14 08:34:01] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 1506 ms :[p0, p0, p0, p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s50 1) (LT s100 1)) (OR (LT s87 1) (LT s137 1)) (OR (LT s82 1) (LT s132 1)) (OR (LT s92 1) (LT s142 1)) (OR (LT s60 1) (LT s110 1)) (OR (L...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 23159 reset in 771 ms.
Stack based approach found an accepted trace after 78315 steps with 18182 reset with depth 7 and stack size 7 in 645 ms.
FORMULA Philosophers-COL-000050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-12 finished in 3291 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(G((X(F(!p1))||p0))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:34:04] [INFO ] Invariant cache hit.
[2023-03-14 08:34:04] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-14 08:34:04] [INFO ] Invariant cache hit.
[2023-03-14 08:34:04] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-14 08:34:04] [INFO ] Invariant cache hit.
[2023-03-14 08:34:04] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s50 1) (GEQ s100 1)) (AND (GEQ s87 1) (GEQ s137 1)) (AND (GEQ s82 1) (GEQ s132 1)) (AND (GEQ s92 1) (GEQ s142 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1003 reset in 587 ms.
Stack based approach found an accepted trace after 66156 steps with 609 reset with depth 175 and stack size 173 in 403 ms.
FORMULA Philosophers-COL-000050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-13 finished in 1567 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(F(!p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:34:06] [INFO ] Invariant cache hit.
[2023-03-14 08:34:06] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-14 08:34:06] [INFO ] Invariant cache hit.
[2023-03-14 08:34:06] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-14 08:34:06] [INFO ] Invariant cache hit.
[2023-03-14 08:34:06] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s13 1) (LT s63 1)) (OR (LT s8 1) (LT s58 1)) (OR (LT s18 1) (LT s68 1)) (OR (LT s40 1) (LT s90 1)) (OR (LT s28 1) (LT s78 1)) (OR (LT s1 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 848 ms.
Product exploration explored 100000 steps with 50000 reset in 856 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) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-14 finished in 2381 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((G(!p0) U p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 08:34:08] [INFO ] Invariant cache hit.
[2023-03-14 08:34:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-14 08:34:08] [INFO ] Invariant cache hit.
[2023-03-14 08:34:08] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-14 08:34:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 08:34:08] [INFO ] Invariant cache hit.
[2023-03-14 08:34:08] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 1))...], nbAcceptance=2, 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 388 reset in 747 ms.
Stack based approach found an accepted trace after 840 steps with 2 reset with depth 310 and stack size 309 in 7 ms.
FORMULA Philosophers-COL-000050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-15 finished in 1486 ms.
All properties solved by simple procedures.
Total runtime 24509 ms.
ITS solved all properties within timeout

BK_STOP 1678782853694

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-000050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Philosophers-COL-000050, 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 r295-tall-167873947400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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