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-167873947500131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 14:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 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 Philosophers-COL-000500-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678784699912

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=Philosophers-COL-000500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 09:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:05:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 09:05:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:05:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 703 ms
[2023-03-14 09:05:02] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:05:02] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 09:05:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10039 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 09:05:02] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-14 09:05:02] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:05:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 09:05:02] [INFO ] After 31ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-14 09:05:02] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:05:02] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 09:05:02] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:05:02] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 43 ms.
[2023-03-14 09:05:02] [INFO ] Unfolded 12 HLPN properties in 3 ms.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 31 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 09:05:03] [INFO ] Computed 1000 place invariants in 29 ms
[2023-03-14 09:05:03] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-14 09:05:03] [INFO ] Invariant cache hit.
[2023-03-14 09:05:05] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2023-03-14 09:05:05] [INFO ] Invariant cache hit.
[2023-03-14 09:05:07] [INFO ] Dead Transitions using invariants and state equation in 2636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4622 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-14 09:05:07] [INFO ] Flatten gal took : 189 ms
[2023-03-14 09:05:08] [INFO ] Flatten gal took : 148 ms
[2023-03-14 09:05:08] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1358 ms. (steps per millisecond=7 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-14 09:05:12] [INFO ] Invariant cache hit.
[2023-03-14 09:05:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 252 ms returned sat
[2023-03-14 09:05:15] [INFO ] After 2379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 09:05:16] [INFO ] [Nat]Absence check using 1000 positive place invariants in 191 ms returned sat
[2023-03-14 09:05:18] [INFO ] After 1920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 09:05:19] [INFO ] After 2716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-14 09:05:19] [INFO ] After 4332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 5 properties in 90 ms. (steps per millisecond=5 )
Parikh walk visited 5 properties in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 165 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:05:20] [INFO ] Invariant cache hit.
[2023-03-14 09:05:21] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2023-03-14 09:05:21] [INFO ] Invariant cache hit.
[2023-03-14 09:05:24] [INFO ] Implicit Places using invariants and state equation in 2610 ms returned []
Implicit Place search using SMT with State Equation took 3804 ms to find 0 implicit places.
[2023-03-14 09:05:24] [INFO ] Invariant cache hit.
[2023-03-14 09:05:27] [INFO ] Dead Transitions using invariants and state equation in 2811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6782 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 25850 steps with 0 reset in 1073 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-00 finished in 8144 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)||X(F(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:05:28] [INFO ] Invariant cache hit.
[2023-03-14 09:05:29] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-14 09:05:29] [INFO ] Invariant cache hit.
[2023-03-14 09:05:31] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3151 ms to find 0 implicit places.
[2023-03-14 09:05:31] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-14 09:05:31] [INFO ] Invariant cache hit.
[2023-03-14 09:05:34] [INFO ] Dead Transitions using invariants and state equation in 2833 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6202 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], 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 timeout after 54070 steps with 712 reset in 10001 ms.
Product exploration timeout after 52760 steps with 710 reset in 10002 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 (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 31 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 135 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:06:08] [INFO ] Invariant cache hit.
[2023-03-14 09:06:09] [INFO ] Implicit Places using invariants in 959 ms returned []
[2023-03-14 09:06:09] [INFO ] Invariant cache hit.
[2023-03-14 09:06:11] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2023-03-14 09:06:11] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-14 09:06:11] [INFO ] Invariant cache hit.
[2023-03-14 09:06:14] [INFO ] Dead Transitions using invariants and state equation in 2778 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6130 ms. Remains : 2500/2500 places, 2500/2500 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 (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 53470 steps with 701 reset in 10001 ms.
Product exploration timeout after 52450 steps with 692 reset in 10002 ms.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:06:47] [INFO ] Invariant cache hit.
[2023-03-14 09:06:48] [INFO ] Implicit Places using invariants in 933 ms returned []
[2023-03-14 09:06:48] [INFO ] Invariant cache hit.
[2023-03-14 09:06:50] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
[2023-03-14 09:06:50] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-14 09:06:50] [INFO ] Invariant cache hit.
[2023-03-14 09:06:53] [INFO ] Dead Transitions using invariants and state equation in 2826 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5992 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-01 finished in 85680 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(((p0 U p1)&&G(F(p0)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 21 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:06:54] [INFO ] Invariant cache hit.
[2023-03-14 09:06:55] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-14 09:06:55] [INFO ] Invariant cache hit.
[2023-03-14 09:06:57] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 3276 ms to find 0 implicit places.
[2023-03-14 09:06:57] [INFO ] Invariant cache hit.
[2023-03-14 09:07:00] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6058 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-02 finished in 6332 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 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 32 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:07:00] [INFO ] Invariant cache hit.
[2023-03-14 09:07:01] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-14 09:07:01] [INFO ] Invariant cache hit.
[2023-03-14 09:07:04] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
[2023-03-14 09:07:04] [INFO ] Invariant cache hit.
[2023-03-14 09:07:07] [INFO ] Dead Transitions using invariants and state equation in 2894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6697 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT 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:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], 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 timeout after 78090 steps with 22271 reset in 10001 ms.
Product exploration timeout after 75900 steps with 21633 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT 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 116 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 141 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 (NOT 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 (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 156 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 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 28 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:08:09] [INFO ] Invariant cache hit.
[2023-03-14 09:08:10] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2023-03-14 09:08:10] [INFO ] Invariant cache hit.
[2023-03-14 09:08:12] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 3708 ms to find 0 implicit places.
[2023-03-14 09:08:12] [INFO ] Invariant cache hit.
[2023-03-14 09:08:15] [INFO ] Dead Transitions using invariants and state equation in 2724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6473 ms. Remains : 2500/2500 places, 2500/2500 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 (NOT p0) 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 148 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 139 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) 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 (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 154 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 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 77720 steps with 22147 reset in 10002 ms.
Product exploration timeout after 75190 steps with 21373 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 164 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:09:15] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 09:09:15] [INFO ] Invariant cache hit.
[2023-03-14 09:09:17] [INFO ] Dead Transitions using invariants and state equation in 2608 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2841 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 29 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:09:17] [INFO ] Invariant cache hit.
[2023-03-14 09:09:19] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-14 09:09:19] [INFO ] Invariant cache hit.
[2023-03-14 09:09:21] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-14 09:09:21] [INFO ] Invariant cache hit.
[2023-03-14 09:09:24] [INFO ] Dead Transitions using invariants and state equation in 2712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6623 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 144186 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 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:09:24] [INFO ] Invariant cache hit.
[2023-03-14 09:09:25] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2023-03-14 09:09:25] [INFO ] Invariant cache hit.
[2023-03-14 09:09:28] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3785 ms to find 0 implicit places.
[2023-03-14 09:09:28] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-14 09:09:28] [INFO ] Invariant cache hit.
[2023-03-14 09:09:31] [INFO ] Dead Transitions using invariants and state equation in 2631 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6534 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], 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 0 reset in 5514 ms.
Stack based approach found an accepted trace after 65721 steps with 0 reset with depth 65722 and stack size 3244 in 4192 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-04 finished in 16311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(!p0))&&F(p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 32 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:09:40] [INFO ] Invariant cache hit.
[2023-03-14 09:09:41] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-14 09:09:41] [INFO ] Invariant cache hit.
[2023-03-14 09:09:43] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
[2023-03-14 09:09:43] [INFO ] Invariant cache hit.
[2023-03-14 09:09:46] [INFO ] Dead Transitions using invariants and state equation in 2670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5775 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, true, p0, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5080 ms.
Stack based approach found an accepted trace after 1942 steps with 0 reset with depth 1943 and stack size 1943 in 203 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-05 finished in 11244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0||G(p1)) U X(!p2)) U p3))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 23 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:09:52] [INFO ] Invariant cache hit.
[2023-03-14 09:09:52] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-14 09:09:52] [INFO ] Invariant cache hit.
[2023-03-14 09:09:54] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2023-03-14 09:09:54] [INFO ] Invariant cache hit.
[2023-03-14 09:09:57] [INFO ] Dead Transitions using invariants and state equation in 2683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5293 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (LEQ 2 (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 72280 steps with 24078 reset in 10002 ms.
Product exploration timeout after 70590 steps with 23512 reset in 10001 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 p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1010 ms. (steps per millisecond=9 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 09:11:18] [INFO ] Invariant cache hit.
[2023-03-14 09:11:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 177 ms returned sat
[2023-03-14 09:11:22] [INFO ] After 3544ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-14 09:11:23] [INFO ] [Nat]Absence check using 1000 positive place invariants in 164 ms returned sat
[2023-03-14 09:11:26] [INFO ] After 2685ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-14 09:11:26] [INFO ] After 2832ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-14 09:11:26] [INFO ] After 4152ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 40 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (F (NOT p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p3), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 6 factoid took 484 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-14 09:11:28] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p3))
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 19 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:11:43] [INFO ] Invariant cache hit.
[2023-03-14 09:11:44] [INFO ] Implicit Places using invariants in 787 ms returned []
[2023-03-14 09:11:44] [INFO ] Invariant cache hit.
[2023-03-14 09:11:46] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2023-03-14 09:11:46] [INFO ] Invariant cache hit.
[2023-03-14 09:11:48] [INFO ] Dead Transitions using invariants and state equation in 2663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5375 ms. Remains : 2500/2500 places, 2500/2500 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) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:12:02] [INFO ] Invariant cache hit.
[2023-03-14 09:12:03] [INFO ] [Real]Absence check using 1000 positive place invariants in 198 ms returned sat
[2023-03-14 09:12:03] [INFO ] After 1298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 09:12:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 178 ms returned sat
[2023-03-14 09:12:08] [INFO ] After 3331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 09:12:08] [INFO ] After 3477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-14 09:12:08] [INFO ] After 4832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 45 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F p1), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-14 09:12:10] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Product exploration timeout after 76690 steps with 25554 reset in 10001 ms.
Product exploration timeout after 74300 steps with 24751 reset in 10003 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 35 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:12:45] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 09:12:45] [INFO ] Invariant cache hit.
[2023-03-14 09:12:48] [INFO ] Dead Transitions using invariants and state equation in 2899 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3008 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 16 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:12:48] [INFO ] Invariant cache hit.
[2023-03-14 09:12:49] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-14 09:12:49] [INFO ] Invariant cache hit.
[2023-03-14 09:12:51] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
[2023-03-14 09:12:51] [INFO ] Invariant cache hit.
[2023-03-14 09:12:54] [INFO ] Dead Transitions using invariants and state equation in 2908 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5524 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-06 finished in 182201 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 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:12:54] [INFO ] Invariant cache hit.
[2023-03-14 09:12:55] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-14 09:12:55] [INFO ] Invariant cache hit.
[2023-03-14 09:12:57] [INFO ] Implicit Places using invariants and state equation in 2539 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
[2023-03-14 09:12:57] [INFO ] Invariant cache hit.
[2023-03-14 09:13:00] [INFO ] Dead Transitions using invariants and state equation in 2818 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6511 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-08 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 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9287 ms.
Product exploration explored 100000 steps with 50000 reset in 9768 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-08 finished in 55452 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 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:13:49] [INFO ] Invariant cache hit.
[2023-03-14 09:13:50] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2023-03-14 09:13:50] [INFO ] Invariant cache hit.
[2023-03-14 09:13:53] [INFO ] Implicit Places using invariants and state equation in 2620 ms returned []
Implicit Place search using SMT with State Equation took 3791 ms to find 0 implicit places.
[2023-03-14 09:13:53] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-14 09:13:53] [INFO ] Invariant cache hit.
[2023-03-14 09:13:56] [INFO ] Dead Transitions using invariants and state equation in 2904 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6841 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 ...], 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 0 reset in 3154 ms.
Stack based approach found an accepted trace after 3710 steps with 0 reset with depth 3711 and stack size 3165 in 238 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-09 finished in 10301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 21 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:14:00] [INFO ] Invariant cache hit.
[2023-03-14 09:14:01] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-14 09:14:01] [INFO ] Invariant cache hit.
[2023-03-14 09:14:03] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
[2023-03-14 09:14:03] [INFO ] Invariant cache hit.
[2023-03-14 09:14:06] [INFO ] Dead Transitions using invariants and state equation in 2853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6653 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s202...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-10 finished in 6773 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 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&X(F(p2)))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 13 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:14:06] [INFO ] Invariant cache hit.
[2023-03-14 09:14:07] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-14 09:14:07] [INFO ] Invariant cache hit.
[2023-03-14 09:14:09] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2023-03-14 09:14:09] [INFO ] Invariant cache hit.
[2023-03-14 09:14:12] [INFO ] Dead Transitions using invariants and state equation in 2834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5299 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 39180 steps with 643 reset in 10002 ms.
Product exploration timeout after 38370 steps with 630 reset in 10002 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) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1723 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 519 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-14 09:19:06] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 9 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:19:21] [INFO ] Invariant cache hit.
[2023-03-14 09:19:22] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-14 09:19:22] [INFO ] Invariant cache hit.
[2023-03-14 09:19:23] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
[2023-03-14 09:19:24] [INFO ] Invariant cache hit.
[2023-03-14 09:19:26] [INFO ] Dead Transitions using invariants and state equation in 2660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4982 ms. Remains : 2500/2500 places, 2500/2500 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 (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1663 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 517 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-14 09:22:48] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 45640 steps with 755 reset in 10001 ms.
Product exploration timeout after 44670 steps with 718 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 21 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:23:24] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 09:23:24] [INFO ] Invariant cache hit.
[2023-03-14 09:23:26] [INFO ] Dead Transitions using invariants and state equation in 2591 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2696 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:23:26] [INFO ] Invariant cache hit.
[2023-03-14 09:23:27] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-14 09:23:27] [INFO ] Invariant cache hit.
[2023-03-14 09:23:29] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-14 09:23:29] [INFO ] Invariant cache hit.
[2023-03-14 09:23:31] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5017 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 565020 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((!p0||G(p1))))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 35 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:23:31] [INFO ] Invariant cache hit.
[2023-03-14 09:23:33] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2023-03-14 09:23:33] [INFO ] Invariant cache hit.
[2023-03-14 09:23:35] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-14 09:23:35] [INFO ] Invariant cache hit.
[2023-03-14 09:23:38] [INFO ] Dead Transitions using invariants and state equation in 2655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6585 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 3 (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9433 ms.
Product exploration explored 100000 steps with 50000 reset in 9757 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-15 finished in 51205 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)||X(F(p1)))))'
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 : Philosophers-COL-000500-LTLCardinality-03
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:24:23] [INFO ] Invariant cache hit.
[2023-03-14 09:24:24] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-14 09:24:24] [INFO ] Invariant cache hit.
[2023-03-14 09:24:27] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3802 ms to find 0 implicit places.
[2023-03-14 09:24:27] [INFO ] Invariant cache hit.
[2023-03-14 09:24:29] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6525 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT 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:(GT 1 (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1...], 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 timeout after 78050 steps with 22283 reset in 10003 ms.
Product exploration timeout after 75260 steps with 21419 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT 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 151 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) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 152 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p1 (NOT 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 (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 136 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) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:25:35] [INFO ] Invariant cache hit.
[2023-03-14 09:25:36] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2023-03-14 09:25:36] [INFO ] Invariant cache hit.
[2023-03-14 09:25:39] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 3903 ms to find 0 implicit places.
[2023-03-14 09:25:39] [INFO ] Invariant cache hit.
[2023-03-14 09:25:42] [INFO ] Dead Transitions using invariants and state equation in 2801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6730 ms. Remains : 2500/2500 places, 2500/2500 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 (NOT p0) 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 154 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 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 152 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) 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 (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 190 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 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 75280 steps with 21378 reset in 10004 ms.
Product exploration timeout after 72790 steps with 20778 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 34 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:26:45] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 09:26:45] [INFO ] Invariant cache hit.
[2023-03-14 09:26:48] [INFO ] Dead Transitions using invariants and state equation in 2986 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3110 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 21 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:26:48] [INFO ] Invariant cache hit.
[2023-03-14 09:26:49] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-03-14 09:26:49] [INFO ] Invariant cache hit.
[2023-03-14 09:26:52] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
[2023-03-14 09:26:52] [INFO ] Invariant cache hit.
[2023-03-14 09:26:54] [INFO ] Dead Transitions using invariants and state equation in 2900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6826 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 151929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0||G(p1)) U X(!p2)) U p3))))'
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 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&X(F(p2)))))'
Found a Shortening insensitive property : Philosophers-COL-000500-LTLCardinality-12
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:26:55] [INFO ] Invariant cache hit.
[2023-03-14 09:26:56] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-14 09:26:56] [INFO ] Invariant cache hit.
[2023-03-14 09:26:57] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2023-03-14 09:26:57] [INFO ] Invariant cache hit.
[2023-03-14 09:27:00] [INFO ] Dead Transitions using invariants and state equation in 3029 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5401 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 38910 steps with 659 reset in 10001 ms.
Product exploration timeout after 37590 steps with 623 reset in 10002 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) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 422 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1412 ms. (steps per millisecond=7 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 512 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 518 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-14 09:31:54] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 9 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:32:09] [INFO ] Invariant cache hit.
[2023-03-14 09:32:10] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-14 09:32:10] [INFO ] Invariant cache hit.
[2023-03-14 09:32:12] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2330 ms to find 0 implicit places.
[2023-03-14 09:32:12] [INFO ] Invariant cache hit.
[2023-03-14 09:32:14] [INFO ] Dead Transitions using invariants and state equation in 2698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5059 ms. Remains : 2500/2500 places, 2500/2500 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 (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 342 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1629 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Finished Best-First random walk after 3994 steps, including 0 resets, run visited all 2 properties in 524 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 484 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2023-03-14 09:35:36] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 45600 steps with 758 reset in 10001 ms.
Product exploration timeout after 44850 steps with 731 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 35 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:36:12] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 09:36:12] [INFO ] Invariant cache hit.
[2023-03-14 09:36:14] [INFO ] Dead Transitions using invariants and state equation in 2656 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2774 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 11 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 09:36:14] [INFO ] Invariant cache hit.
[2023-03-14 09:36:15] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-14 09:36:15] [INFO ] Invariant cache hit.
[2023-03-14 09:36:17] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2505 ms to find 0 implicit places.
[2023-03-14 09:36:17] [INFO ] Invariant cache hit.
[2023-03-14 09:36:20] [INFO ] Dead Transitions using invariants and state equation in 2763 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5283 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 565175 ms.
[2023-03-14 09:36:20] [INFO ] Flatten gal took : 90 ms
[2023-03-14 09:36:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-14 09:36:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 10 ms.
Total runtime 1879171 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-000500
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Philosophers-COL-000500-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000500-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000500-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000500-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678786587358

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-COL-000500-LTLCardinality-01
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-COL-000500-LTLCardinality-01
lola: result : false
lola: markings : 161706
lola: fired transitions : 242107
lola: time used : 2.000000
lola: memory pages used : 4
lola: LAUNCH task # 10 (type EXCL) for 9 Philosophers-COL-000500-LTLCardinality-12
lola: time limit : 1198 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for Philosophers-COL-000500-LTLCardinality-12
lola: result : false
lola: markings : 601
lola: fired transitions : 601
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 Philosophers-COL-000500-LTLCardinality-06
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for Philosophers-COL-000500-LTLCardinality-06
lola: result : false
lola: markings : 1301
lola: fired transitions : 1301
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-COL-000500-LTLCardinality-03
lola: time limit : 3594 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Philosophers-COL-000500-LTLCardinality-03
lola: result : false
lola: markings : 20799
lola: fired transitions : 20799
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-000500-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-000500-LTLCardinality-03: LTL false LTL model checker
Philosophers-COL-000500-LTLCardinality-06: LTL false LTL model checker
Philosophers-COL-000500-LTLCardinality-12: LTL false LTL model checker


Time elapsed: 6 secs. Pages in use: 4

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000500"
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 Philosophers-COL-000500, 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-167873947500131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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