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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:06 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 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K 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-COL-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678814623855

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 17:23:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 17:23:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:23: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 17:23:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 17:23:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 404 ms
[2023-03-14 17:23:45] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 17:23:46] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2023-03-14 17:23:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 29) seen :26
Incomplete Best-First random walk after 10001 steps, including 620 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 541 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 17:23:46] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-14 17:23:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 17:23:46] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 17:23:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:23:46] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-14 17:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 17:23:46] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-14 17:23:46] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 17:23:46] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-14 17:23:46] [INFO ] Invariant cache hit.
[2023-03-14 17:23:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10000 steps, including 1356 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 269 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Probably explored full state space saw : 42 states, properties seen :0
Probabilistic random walk after 118 steps, saw 42 distinct states, run finished after 14 ms. (steps per millisecond=8 ) properties seen :0
Explored full state space saw : 42 states, properties seen :0
Exhaustive walk after 118 steps, saw 42 distinct states, run finished after 2 ms. (steps per millisecond=59 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 17:23:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 17:23:47] [INFO ] Flatten gal took : 18 ms
[2023-03-14 17:23:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 17:23:47] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 17:23:47] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 9 ms.
[2023-03-14 17:23:47] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 17:23:47] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 17:23:47] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-14 17:23:47] [INFO ] Dead Transitions using invariants and state equation in 69 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 17:23:47] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-14 17:23:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 17:23:47] [INFO ] Invariant cache hit.
[2023-03-14 17:23:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 81 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 154 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-14 17:23:47] [INFO ] Flatten gal took : 9 ms
[2023-03-14 17:23:47] [INFO ] Flatten gal took : 8 ms
[2023-03-14 17:23:47] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1400 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 417 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:23:47] [INFO ] Invariant cache hit.
[2023-03-14 17:23:47] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:23:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:23:47] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:23:47] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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(p0)||X(p1)))'
Support contains 9 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 17:23:47] [INFO ] Invariant cache hit.
[2023-03-14 17:23:47] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
[2023-03-14 17:23:47] [INFO ] Invariant cache hit.
[2023-03-14 17:23:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-14 17:23:47] [INFO ] Invariant cache hit.
[2023-03-14 17:23:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s21 s22 s23)), p1:(AND (LEQ 2 (ADD s12 s13 s14)) (LEQ 1 (ADD s27 s28 s29)))], 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-00 finished in 474 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)))'
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 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:48] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s27 s28 s29))], 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 12 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-01 finished in 265 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)||G((p1||X((p2 U p3)))))))'
Support contains 9 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 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-14 17:23:48] [INFO ] Invariant cache hit.
[2023-03-14 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s12 s13 s14)), p1:(LEQ 2 (ADD s15 s16 s17)), p3:(AND (LEQ (ADD s18 s19 s20) (ADD s12 s13 s14)) (LEQ 2 (ADD s15 s16 s17))), p2:(LEQ (ADD s18 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23064 reset in 328 ms.
Product exploration explored 100000 steps with 23344 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 854 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 396 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 259 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 393 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-14 17:23:50] [INFO ] Invariant cache hit.
[2023-03-14 17:23:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:23:50] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:23:50] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (AND p0 p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3) (NOT p1))))]
Knowledge based reduction with 21 factoid took 1206 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false]
Stuttering acceptance computed with spot in 100 ms :[false, false]
Support contains 9 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 17:23:52] [INFO ] Invariant cache hit.
[2023-03-14 17:23:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 17:23:52] [INFO ] Invariant cache hit.
[2023-03-14 17:23:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 17:23:52] [INFO ] Invariant cache hit.
[2023-03-14 17:23:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 17:23:52] [INFO ] Invariant cache hit.
[2023-03-14 17:23:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 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 p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 623 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[false, false]
Finished random walk after 5 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR p0 (AND (NOT p2) (NOT p3))))), (F p1), (F (AND (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 608 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[false, false]
Stuttering acceptance computed with spot in 92 ms :[false, false]
Stuttering acceptance computed with spot in 94 ms :[false, false]
Product exploration explored 100000 steps with 23090 reset in 248 ms.
Product exploration explored 100000 steps with 23311 reset in 205 ms.
Support contains 9 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 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-02 finished in 6224 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(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 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-14 17:23:54] [INFO ] Invariant cache hit.
[2023-03-14 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-03 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s18 s19 s20))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-03 finished in 419 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((F(p0)&&(X(p0)||G(p1))))))'
Support contains 21 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 17:23:55] [INFO ] Invariant cache hit.
[2023-03-14 17:23:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-14 17:23:55] [INFO ] Invariant cache hit.
[2023-03-14 17:23:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 17:23:55] [INFO ] Invariant cache hit.
[2023-03-14 17:23:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:55] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-14 17:23:55] [INFO ] Invariant cache hit.
[2023-03-14 17:23:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s27 s28 s29) (ADD s15 s16 s17)), p1:(AND (LEQ (ADD s18 s19 s20) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)) (LEQ (ADD s9 s10 s11) (ADD s27 s28 s29)))], 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 33333 reset in 153 ms.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-05 finished in 778 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)))||G(!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 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:23:55] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), p0, false, (NOT p0), false, false]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-07 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=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(GT (ADD s21 s22 s23) (ADD s18 s19 s20))], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-07 finished in 435 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||(X(!p1)&&((p2||F(p3)) U (G((p2||F(p3)))||((p2||F(p3))&&X(p0)))))))))'
Support contains 21 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 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), p1, (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), true]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT 2 (ADD s9 s10 s11)), p2:(GT (ADD s15 s16 s17) (ADD s18 s19 s20)), p3:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD s15 s16 s17)), p1:(LEQ (ADD s27 s28 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-09 finished in 448 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)&&X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 21 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 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 17:23:56] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 1 (ADD s27 s28 s29)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD s12 s13 s14)), p2:(LEQ (ADD s24 s25 s26) (ADD s15 s16 s17))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-10 finished in 571 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 6 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 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-14 17:23:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [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 187 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-11 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:(GT (ADD s18 s19 s20) (ADD s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-11 finished in 269 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 6 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 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:57] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-14 17:23:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s27 s28 s29) (ADD s24 s25 s26))], 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 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-12 finished in 248 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(p0)))||(F(G(p1))&&F(p2))))'
Support contains 12 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 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 17:23:57] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:58] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23: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 163 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=p1, acceptance={} source=7 dest: 7}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(GT 1 (ADD s12 s13 s14)), p0:(LEQ (ADD s9 s10 s11) (ADD s27 s28 s29)), p1:(LEQ 1 (ADD s24 s25 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 3 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-14 finished in 513 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))))'
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 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(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=[p0:(GT 1 (ADD s21 s22 s23))], 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]]
Stuttering criterion allowed to conclude after 31 steps with 8 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-15 finished in 308 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)||G((p1||X((p2 U p3)))))))'
Found a Lengthening insensitive property : PhilosophersDyn-COL-03-LTLCardinality-02
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 9 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 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 17:23:58] [INFO ] Invariant cache hit.
[2023-03-14 17:23:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 17:23:59] [INFO ] Invariant cache hit.
[2023-03-14 17:23:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:23:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 17:23:59] [INFO ] Invariant cache hit.
[2023-03-14 17:23:59] [INFO ] Dead Transitions using invariants and state equation in 34 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-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s12 s13 s14)), p1:(LEQ 2 (ADD s15 s16 s17)), p3:(AND (LEQ (ADD s18 s19 s20) (ADD s12 s13 s14)) (LEQ 2 (ADD s15 s16 s17))), p2:(LEQ (ADD s18 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23043 reset in 179 ms.
Product exploration explored 100000 steps with 23374 reset in 194 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 931 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1416 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 392 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 267 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 367 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 393 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-14 17:24:00] [INFO ] Invariant cache hit.
[2023-03-14 17:24:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-14 17:24:00] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 17:24:00] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (AND p0 p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3) (NOT p1))))]
Knowledge based reduction with 21 factoid took 968 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[false, false]
Stuttering acceptance computed with spot in 79 ms :[false, false]
Support contains 9 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 17:24:02] [INFO ] Invariant cache hit.
[2023-03-14 17:24:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-14 17:24:02] [INFO ] Invariant cache hit.
[2023-03-14 17:24:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 17:24:02] [INFO ] Invariant cache hit.
[2023-03-14 17:24:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:02] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-14 17:24:02] [INFO ] Invariant cache hit.
[2023-03-14 17:24:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 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 p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 580 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[false, false]
Finished random walk after 4 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR p0 (AND (NOT p2) (NOT p3))))), (F p1), (F (AND (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 585 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[false, false]
Stuttering acceptance computed with spot in 90 ms :[false, false]
Stuttering acceptance computed with spot in 72 ms :[false, false]
Product exploration explored 100000 steps with 23115 reset in 152 ms.
Product exploration explored 100000 steps with 23230 reset in 163 ms.
Support contains 9 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 17:24:04] [INFO ] Invariant cache hit.
[2023-03-14 17:24:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 17:24:04] [INFO ] Invariant cache hit.
[2023-03-14 17:24:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 17:24:04] [INFO ] Invariant cache hit.
[2023-03-14 17:24:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 17:24:04] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 17:24:04] [INFO ] Invariant cache hit.
[2023-03-14 17:24:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-02 finished in 5598 ms.
[2023-03-14 17:24:04] [INFO ] Flatten gal took : 5 ms
[2023-03-14 17:24:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 17:24:04] [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 19128 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-COL-03
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLCardinality

FORMULA PhilosophersDyn-COL-03-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678814645438

--------------------
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 LTLCardinality -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/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-COL-03-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-COL-03-LTLCardinality-02
lola: result : true
lola: markings : 1045
lola: fired transitions : 3666
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-COL-03-LTLCardinality-02: 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-COL-03"
export BK_EXAMINATION="LTLCardinality"
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-COL-03, examination is LTLCardinality"
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-167873947700275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;