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-167873947700316.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 PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678824390452

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=PhilosophersDyn-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 20:06:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 20:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:06:31] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-14 20:06:31] [INFO ] Transformed 30 places.
[2023-03-14 20:06:31] [INFO ] Transformed 84 transitions.
[2023-03-14 20:06:31] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:06:32] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 20:06:32] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 20:06:32] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-14 20:06:32] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 20:06:32] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-14 20:06:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-14 20:06:32] [INFO ] Invariant cache hit.
[2023-03-14 20:06:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 28 out of 30 places after structural reductions.
[2023-03-14 20:06:32] [INFO ] Flatten gal took : 23 ms
[2023-03-14 20:06:32] [INFO ] Flatten gal took : 12 ms
[2023-03-14 20:06:32] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 334 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 323 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 20:06:33] [INFO ] Invariant cache hit.
[2023-03-14 20:06:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-14 20:06:33] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:06:33] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA PhilosophersDyn-PT-03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-14 20:06:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1))), p1:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 7 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-00 finished in 2845 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(p1))||p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:36] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-14 20:06:36] [INFO ] Invariant cache hit.
[2023-03-14 20:06:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s9 1) (GEQ s12 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s22 1)) (AND (GEQ s4 1) (GEQ s21 1) (GEQ s27 1)) (AND (GEQ s12 1) (GEQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14330 reset in 455 ms.
Stack based approach found an accepted trace after 53 steps with 7 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-01 finished in 928 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 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:37] [INFO ] Invariant cache hit.
[2023-03-14 20:06:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-14 20:06:37] [INFO ] Invariant cache hit.
[2023-03-14 20:06:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:06:37] [INFO ] Invariant cache hit.
[2023-03-14 20:06:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-14 20:06:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:37] [INFO ] Invariant cache hit.
[2023-03-14 20:06:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-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 s4 1) (LT s10 1) (LT s16 1) (LT s19 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1) (LT s25 1)) (OR (LT s4 1) (LT s10 1) (LT s16 2)) (OR (LT s3 1)...], 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 14318 reset in 390 ms.
Stack based approach found an accepted trace after 45 steps with 7 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-02 finished in 639 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(F(p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:38] [INFO ] Invariant cache hit.
[2023-03-14 20:06:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-14 20:06:38] [INFO ] Invariant cache hit.
[2023-03-14 20:06:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 20:06:38] [INFO ] Invariant cache hit.
[2023-03-14 20:06:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 20:06:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:38] [INFO ] Invariant cache hit.
[2023-03-14 20:06:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s6 1) (LT s9 1) (LT s12 1)) (OR (LT s5 1) (LT s14 1) (LT s22 1)) (OR (LT s4 1) (LT s21 1) (LT s27 1)) (OR (LT s12 1) (LT s21 1) (LT s25 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16810 reset in 235 ms.
Product exploration explored 100000 steps with 16869 reset in 214 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 1541 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:40] [INFO ] Invariant cache hit.
[2023-03-14 20:06:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 20:06:40] [INFO ] Invariant cache hit.
[2023-03-14 20:06:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 20:06:41] [INFO ] Invariant cache hit.
[2023-03-14 20:06:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 20:06:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:41] [INFO ] Invariant cache hit.
[2023-03-14 20:06:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 30/30 places, 51/51 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16855 reset in 193 ms.
Product exploration explored 100000 steps with 16802 reset in 195 ms.
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-14 20:06:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLFireability-03 finished in 4111 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)&&(p1||X(X(X(X(F(p2)))))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p2), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}]], initial=4, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1))), p2:(AND (OR (LT s8 1) (LT s12 1) (LT s14 1) (LT s17 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-04 finished in 550 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(F((p0||G(!p1))))))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 20:06:42] [INFO ] Invariant cache hit.
[2023-03-14 20:06:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-14 20:06:43] [INFO ] Invariant cache hit.
[2023-03-14 20:06:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1))), p0:(AND (OR (LT s8 1) (LT s12 1) (LT s14 1) (LT s17 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29510 reset in 235 ms.
Product exploration explored 100000 steps with 29492 reset in 229 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 9 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 2002 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:46] [INFO ] Invariant cache hit.
[2023-03-14 20:06:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 20:06:46] [INFO ] Invariant cache hit.
[2023-03-14 20:06:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 20:06:46] [INFO ] Invariant cache hit.
[2023-03-14 20:06:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-14 20:06:46] [INFO ] Invariant cache hit.
[2023-03-14 20:06:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 30/30 places, 51/51 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)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29485 reset in 269 ms.
Product exploration explored 100000 steps with 29461 reset in 270 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:47] [INFO ] Invariant cache hit.
[2023-03-14 20:06:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-14 20:06:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 20:06:47] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 30/30 places, 51/51 transitions.
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLFireability-05 finished in 5316 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||X(G((p1||G(!p0)))))) U p0)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s29 1)), p1:(AND (OR (LT s6 1) (LT s9 1) (LT s12 1)) (OR (LT s5 1) (LT s14 1) (LT s22 1)) (OR (LT s4 1) (LT s21 1) (LT...], 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]]
Stuttering criterion allowed to conclude after 380 steps with 55 reset in 3 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-07 finished in 333 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 U p2))||p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s13 1) (GEQ s15 1) (GEQ s26 1))), p2:(AND (GEQ s7 1) (GEQ s4 1) (GEQ s24 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]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-08 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-14 20:06:48] [INFO ] Invariant cache hit.
[2023-03-14 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 1803 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s2 1) (GEQ s11 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-12 finished in 2012 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(F(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:50] [INFO ] Invariant cache hit.
[2023-03-14 20:06:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 20:06:50] [INFO ] Invariant cache hit.
[2023-03-14 20:06:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 20:06:50] [INFO ] Invariant cache hit.
[2023-03-14 20:06:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:50] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-14 20:06:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:50] [INFO ] Invariant cache hit.
[2023-03-14 20:06:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s26 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14493 reset in 146 ms.
Product exploration explored 100000 steps with 14451 reset in 151 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 880 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 404 steps, including 56 resets, run visited all 1 properties in 6 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:52] [INFO ] Invariant cache hit.
[2023-03-14 20:06:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 20:06:52] [INFO ] Invariant cache hit.
[2023-03-14 20:06:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 20:06:52] [INFO ] Invariant cache hit.
[2023-03-14 20:06:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-14 20:06:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:06:52] [INFO ] Invariant cache hit.
[2023-03-14 20:06:52] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 30/30 places, 51/51 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 697 steps, including 102 resets, run visited all 1 properties in 8 ms. (steps per millisecond=87 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14430 reset in 157 ms.
Product exploration explored 100000 steps with 14512 reset in 179 ms.
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:53] [INFO ] Invariant cache hit.
[2023-03-14 20:06:53] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
[2023-03-14 20:06:53] [INFO ] Invariant cache hit.
[2023-03-14 20:06:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 20:06:53] [INFO ] Invariant cache hit.
[2023-03-14 20:06:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-14 20:06:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 20:06:53] [INFO ] Invariant cache hit.
[2023-03-14 20:06:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLFireability-14 finished in 3242 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(F(p0)))'
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(F((p0||G(!p1))))))'
Found a Shortening insensitive property : PhilosophersDyn-PT-03-LTLFireability-05
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:57] [INFO ] Invariant cache hit.
[2023-03-14 20:06:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-14 20:06:57] [INFO ] Invariant cache hit.
[2023-03-14 20:06:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 20:06:57] [INFO ] Invariant cache hit.
[2023-03-14 20:06:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 20:06:57] [INFO ] Invariant cache hit.
[2023-03-14 20:06:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 51/51 transitions.
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1))), p0:(AND (OR (LT s8 1) (LT s12 1) (LT s14 1) (LT s17 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29510 reset in 217 ms.
Product exploration explored 100000 steps with 29516 reset in 232 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 12 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:06:58] [INFO ] Invariant cache hit.
[2023-03-14 20:06:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 20:06:58] [INFO ] Invariant cache hit.
[2023-03-14 20:06:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 20:06:58] [INFO ] Invariant cache hit.
[2023-03-14 20:06:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:06:58] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-14 20:06:58] [INFO ] Invariant cache hit.
[2023-03-14 20:06:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 30/30 places, 51/51 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)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1642 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 24 steps, including 4 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29513 reset in 259 ms.
Product exploration explored 100000 steps with 29510 reset in 267 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:07:01] [INFO ] Invariant cache hit.
[2023-03-14 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 20:07:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:07:01] [INFO ] Invariant cache hit.
[2023-03-14 20:07:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 30/30 places, 51/51 transitions.
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:07:01] [INFO ] Invariant cache hit.
[2023-03-14 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 20:07:02] [INFO ] Invariant cache hit.
[2023-03-14 20:07:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 20:07:02] [INFO ] Invariant cache hit.
[2023-03-14 20:07:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:07:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-14 20:07:02] [INFO ] Invariant cache hit.
[2023-03-14 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLFireability-05 finished in 5108 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(F(p0)))'
[2023-03-14 20:07:02] [INFO ] Flatten gal took : 10 ms
[2023-03-14 20:07:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 20:07:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 1 ms.
Total runtime 30357 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-PT-03
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA PhilosophersDyn-PT-03-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678824436572

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 PhilosophersDyn-PT-03-LTLFireability-05
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for PhilosophersDyn-PT-03-LTLFireability-05
lola: result : true
lola: markings : 115
lola: fired transitions : 165
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 PhilosophersDyn-PT-03-LTLFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for PhilosophersDyn-PT-03-LTLFireability-14
lola: result : true
lola: markings : 321
lola: fired transitions : 750
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-PT-03-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-PT-03-LTLFireability-03
lola: result : true
lola: markings : 610
lola: fired transitions : 1656
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-03-LTLFireability-03: LTL true LTL model checker
PhilosophersDyn-PT-03-LTLFireability-05: LTL true LTL model checker
PhilosophersDyn-PT-03-LTLFireability-14: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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-167873947700316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 ;