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.r297-tall-167873950000124.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 ltsminxred
Input is Philosophers-COL-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950000124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:13 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 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:30 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 18K 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-COL-000200-LTLFireability-01
FORMULA_NAME Philosophers-COL-000200-LTLFireability-02
FORMULA_NAME Philosophers-COL-000200-LTLFireability-03
FORMULA_NAME Philosophers-COL-000200-LTLFireability-04
FORMULA_NAME Philosophers-COL-000200-LTLFireability-05
FORMULA_NAME Philosophers-COL-000200-LTLFireability-06
FORMULA_NAME Philosophers-COL-000200-LTLFireability-07
FORMULA_NAME Philosophers-COL-000200-LTLFireability-08
FORMULA_NAME Philosophers-COL-000200-LTLFireability-09
FORMULA_NAME Philosophers-COL-000200-LTLFireability-10
FORMULA_NAME Philosophers-COL-000200-LTLFireability-11
FORMULA_NAME Philosophers-COL-000200-LTLFireability-12
FORMULA_NAME Philosophers-COL-000200-LTLFireability-13
FORMULA_NAME Philosophers-COL-000200-LTLFireability-14
FORMULA_NAME Philosophers-COL-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679451209821

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:13:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:13:31] [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-22 02:13:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 02:13:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 539 ms
[2023-03-22 02:13:32] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 02:13:32] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 02:13:32] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10099 steps, including 49 resets, run finished after 33 ms. (steps per millisecond=306 ) properties (out of 4) seen :3
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
[2023-03-22 02:13:32] [INFO ] Flatten gal took : 15 ms
[2023-03-22 02:13:32] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 02:13:32] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 35 ms.
[2023-03-22 02:13:32] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-22 02:13:33] [INFO ] Computed 400 place invariants in 30 ms
[2023-03-22 02:13:33] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-22 02:13:33] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-22 02:13:34] [INFO ] Invariant cache hit.
[2023-03-22 02:13:34] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2023-03-22 02:13:35] [INFO ] Flatten gal took : 128 ms
[2023-03-22 02:13:35] [INFO ] Flatten gal took : 125 ms
[2023-03-22 02:13:36] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 2931 steps, including 0 resets, run visited all 13 properties in 191 ms. (steps per millisecond=15 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:13:37] [INFO ] Invariant cache hit.
[2023-03-22 02:13:37] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-22 02:13:37] [INFO ] Invariant cache hit.
[2023-03-22 02:13:38] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2023-03-22 02:13:38] [INFO ] Invariant cache hit.
[2023-03-22 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1887 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s316 1) (GEQ s516 1)) (AND (GEQ s321 1) (GEQ s521 1)) (AND (GEQ s331 1) (GEQ s531 1)) (AND (GEQ s301 1) (GEQ s501 1)) (AND (GEQ s311 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33255 reset in 5737 ms.
Product exploration explored 100000 steps with 33394 reset in 5796 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2617 steps, including 0 resets, run visited all 3 properties in 51 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:13:55] [INFO ] Invariant cache hit.
[2023-03-22 02:13:55] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-22 02:13:55] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2023-03-22 02:13:56] [INFO ] Invariant cache hit.
[2023-03-22 02:13:56] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 1000/1000 places, 1000/1000 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 p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6157 steps, including 1 resets, run visited all 3 properties in 110 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33372 reset in 4792 ms.
Product exploration explored 100000 steps with 33303 reset in 5029 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 57 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:09] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 02:14:09] [INFO ] Invariant cache hit.
[2023-03-22 02:14:10] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 888 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:10] [INFO ] Invariant cache hit.
[2023-03-22 02:14:10] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-22 02:14:10] [INFO ] Invariant cache hit.
[2023-03-22 02:14:11] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-22 02:14:11] [INFO ] Invariant cache hit.
[2023-03-22 02:14:12] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1680 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-00 finished in 35207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(!p2)&&p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:12] [INFO ] Invariant cache hit.
[2023-03-22 02:14:12] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-22 02:14:12] [INFO ] Invariant cache hit.
[2023-03-22 02:14:13] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2023-03-22 02:14:13] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 02:14:13] [INFO ] Invariant cache hit.
[2023-03-22 02:14:13] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1552 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-03 finished in 1795 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))&&F(((p2 U X(p2))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:14] [INFO ] Invariant cache hit.
[2023-03-22 02:14:14] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-22 02:14:14] [INFO ] Invariant cache hit.
[2023-03-22 02:14:15] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-22 02:14:15] [INFO ] Invariant cache hit.
[2023-03-22 02:14:15] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1770 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 74 reset in 1438 ms.
Stack based approach found an accepted trace after 5122 steps with 2 reset with depth 1118 and stack size 1118 in 78 ms.
FORMULA Philosophers-COL-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-04 finished in 3471 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 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:17] [INFO ] Invariant cache hit.
[2023-03-22 02:14:17] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-22 02:14:17] [INFO ] Invariant cache hit.
[2023-03-22 02:14:18] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2023-03-22 02:14:18] [INFO ] Invariant cache hit.
[2023-03-22 02:14:19] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-05 finished in 1967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:19] [INFO ] Invariant cache hit.
[2023-03-22 02:14:19] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-22 02:14:19] [INFO ] Invariant cache hit.
[2023-03-22 02:14:20] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
[2023-03-22 02:14:20] [INFO ] Invariant cache hit.
[2023-03-22 02:14:21] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1812 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 46 reset in 1572 ms.
Product exploration explored 100000 steps with 38 reset in 1790 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 02:14:30] [INFO ] Invariant cache hit.
[2023-03-22 02:14:31] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 568 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-22 02:14:32] [INFO ] Invariant cache hit.
[2023-03-22 02:14:47] [INFO ] [Real]Absence check using 400 positive place invariants in 547 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:14:47] [INFO ] Invariant cache hit.
[2023-03-22 02:14:48] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-22 02:14:48] [INFO ] Invariant cache hit.
[2023-03-22 02:14:49] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-22 02:14:49] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:14:49] [INFO ] Invariant cache hit.
[2023-03-22 02:14:49] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 1000/1000 places, 1000/1000 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 p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 1612 steps, including 0 resets, run visited all 5 properties in 40 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 578 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-22 02:14:56] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 95 reset in 1796 ms.
Product exploration explored 100000 steps with 96 reset in 1858 ms.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:15:15] [INFO ] Invariant cache hit.
[2023-03-22 02:15:16] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-22 02:15:16] [INFO ] Invariant cache hit.
[2023-03-22 02:15:16] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-22 02:15:16] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:15:16] [INFO ] Invariant cache hit.
[2023-03-22 02:15:17] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1829 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 58113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(G(!p1)))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 42 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:15:17] [INFO ] Invariant cache hit.
[2023-03-22 02:15:18] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-22 02:15:18] [INFO ] Invariant cache hit.
[2023-03-22 02:15:19] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-22 02:15:19] [INFO ] Invariant cache hit.
[2023-03-22 02:15:19] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2043 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 2636 ms.
Stack based approach found an accepted trace after 3630 steps with 0 reset with depth 3631 and stack size 3631 in 71 ms.
FORMULA Philosophers-COL-000200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-09 finished in 5125 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)&&F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:15:22] [INFO ] Invariant cache hit.
[2023-03-22 02:15:23] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-22 02:15:23] [INFO ] Invariant cache hit.
[2023-03-22 02:15:24] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2023-03-22 02:15:24] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 02:15:24] [INFO ] Invariant cache hit.
[2023-03-22 02:15:24] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2048 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5567 reset in 5529 ms.
Product exploration explored 100000 steps with 5844 reset in 5867 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 p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 328 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 02:15:38] [INFO ] Invariant cache hit.
[2023-03-22 02:15:44] [INFO ] [Real]Absence check using 400 positive place invariants in 517 ms returned sat
[2023-03-22 02:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:15:51] [INFO ] [Real]Absence check using state equation in 6968 ms returned sat
[2023-03-22 02:15:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:15:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 420 ms returned sat
[2023-03-22 02:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:15:59] [INFO ] [Nat]Absence check using state equation in 2079 ms returned sat
[2023-03-22 02:15:59] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-22 02:16:00] [INFO ] Added : 40 causal constraints over 8 iterations in 676 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 02:16:00] [INFO ] Invariant cache hit.
[2023-03-22 02:16:02] [INFO ] [Real]Absence check using 400 positive place invariants in 601 ms returned sat
[2023-03-22 02:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:12] [INFO ] [Real]Absence check using state equation in 10082 ms returned sat
[2023-03-22 02:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:16:13] [INFO ] [Nat]Absence check using 400 positive place invariants in 333 ms returned sat
[2023-03-22 02:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:15] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2023-03-22 02:16:15] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 56 ms.
[2023-03-22 02:16:15] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:16:15] [INFO ] Invariant cache hit.
[2023-03-22 02:16:16] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-22 02:16:16] [INFO ] Invariant cache hit.
[2023-03-22 02:16:17] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2023-03-22 02:16:17] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 02:16:17] [INFO ] Invariant cache hit.
[2023-03-22 02:16:17] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2156 ms. Remains : 1000/1000 places, 1000/1000 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)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 02:16:19] [INFO ] Invariant cache hit.
[2023-03-22 02:16:25] [INFO ] [Real]Absence check using 400 positive place invariants in 533 ms returned sat
[2023-03-22 02:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:33] [INFO ] [Real]Absence check using state equation in 7224 ms returned sat
[2023-03-22 02:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:16:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 429 ms returned sat
[2023-03-22 02:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:40] [INFO ] [Nat]Absence check using state equation in 2110 ms returned sat
[2023-03-22 02:16:41] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-22 02:16:41] [INFO ] Added : 40 causal constraints over 8 iterations in 637 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 02:16:41] [INFO ] Invariant cache hit.
[2023-03-22 02:16:43] [INFO ] [Real]Absence check using 400 positive place invariants in 608 ms returned sat
[2023-03-22 02:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:53] [INFO ] [Real]Absence check using state equation in 9855 ms returned sat
[2023-03-22 02:16:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:16:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 354 ms returned sat
[2023-03-22 02:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:16:56] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2023-03-22 02:16:56] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-22 02:16:57] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5203 reset in 5239 ms.
Product exploration explored 100000 steps with 5502 reset in 5616 ms.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 33 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:08] [INFO ] Invariant cache hit.
[2023-03-22 02:17:08] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-22 02:17:08] [INFO ] Invariant cache hit.
[2023-03-22 02:17:09] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-22 02:17:09] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 02:17:09] [INFO ] Invariant cache hit.
[2023-03-22 02:17:10] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2069 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-10 finished in 107365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p1))&&p0)))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:10] [INFO ] Invariant cache hit.
[2023-03-22 02:17:10] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-22 02:17:10] [INFO ] Invariant cache hit.
[2023-03-22 02:17:11] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2023-03-22 02:17:11] [INFO ] Invariant cache hit.
[2023-03-22 02:17:12] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1813 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-000200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-11 finished in 2038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F((p1&&G(p2)))||p0))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:12] [INFO ] Invariant cache hit.
[2023-03-22 02:17:12] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-22 02:17:12] [INFO ] Invariant cache hit.
[2023-03-22 02:17:13] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2023-03-22 02:17:13] [INFO ] Invariant cache hit.
[2023-03-22 02:17:14] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1925 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24023 steps with 0 reset in 374 ms.
FORMULA Philosophers-COL-000200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-12 finished in 2622 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 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:14] [INFO ] Invariant cache hit.
[2023-03-22 02:17:15] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-22 02:17:15] [INFO ] Invariant cache hit.
[2023-03-22 02:17:16] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2023-03-22 02:17:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 02:17:16] [INFO ] Invariant cache hit.
[2023-03-22 02:17:16] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1975 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 1553 ms.
Stack based approach found an accepted trace after 468 steps with 0 reset with depth 469 and stack size 469 in 13 ms.
FORMULA Philosophers-COL-000200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-13 finished in 3612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p0))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:18] [INFO ] Invariant cache hit.
[2023-03-22 02:17:18] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-22 02:17:18] [INFO ] Invariant cache hit.
[2023-03-22 02:17:19] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2023-03-22 02:17:19] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 02:17:19] [INFO ] Invariant cache hit.
[2023-03-22 02:17:20] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2035 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 105 ms :[false, p0, p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 49 reset in 1548 ms.
Stack based approach found an accepted trace after 2348 steps with 0 reset with depth 2349 and stack size 2347 in 39 ms.
FORMULA Philosophers-COL-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-14 finished in 3753 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 (F(!p1)&&G(p2))) U (p1&&(p0 U (F(!p1)&&G(p2)))))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:22] [INFO ] Invariant cache hit.
[2023-03-22 02:17:22] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-22 02:17:22] [INFO ] Invariant cache hit.
[2023-03-22 02:17:23] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-22 02:17:23] [INFO ] Invariant cache hit.
[2023-03-22 02:17:24] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1760 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, true, true, p1, (NOT p2), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1520 steps with 0 reset in 32 ms.
FORMULA Philosophers-COL-000200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-15 finished in 2103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||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' '!(G(((p0 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Found a Shortening insensitive property : Philosophers-COL-000200-LTLFireability-08
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:24] [INFO ] Invariant cache hit.
[2023-03-22 02:17:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-22 02:17:25] [INFO ] Invariant cache hit.
[2023-03-22 02:17:25] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2023-03-22 02:17:25] [INFO ] Invariant cache hit.
[2023-03-22 02:17:26] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1807 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 41 reset in 1534 ms.
Product exploration explored 100000 steps with 46 reset in 1742 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 413 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 02:17:35] [INFO ] Invariant cache hit.
[2023-03-22 02:17:35] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 588 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-22 02:17:37] [INFO ] Invariant cache hit.
[2023-03-22 02:17:52] [INFO ] [Real]Absence check using 400 positive place invariants in 411 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:17:52] [INFO ] Invariant cache hit.
[2023-03-22 02:17:52] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-22 02:17:52] [INFO ] Invariant cache hit.
[2023-03-22 02:17:53] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-22 02:17:53] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 02:17:53] [INFO ] Invariant cache hit.
[2023-03-22 02:17:54] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1798 ms. Remains : 1000/1000 places, 1000/1000 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 p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 2191 steps, including 0 resets, run visited all 5 properties in 41 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 472 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-22 02:18:01] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 100 reset in 1753 ms.
Product exploration explored 100000 steps with 124 reset in 1853 ms.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 02:18:20] [INFO ] Invariant cache hit.
[2023-03-22 02:18:20] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-22 02:18:20] [INFO ] Invariant cache hit.
[2023-03-22 02:18:21] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2023-03-22 02:18:21] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 02:18:21] [INFO ] Invariant cache hit.
[2023-03-22 02:18:21] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1939 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 57700 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)&&F(p1))))'
[2023-03-22 02:18:22] [INFO ] Flatten gal took : 57 ms
[2023-03-22 02:18:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2023-03-22 02:18:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 5 ms.
Total runtime 290423 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1881/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 6567800 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16080276 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1881/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 6328500 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16070196 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1881/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 159600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16301660 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023

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-000200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Philosophers-COL-000200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000200.tgz
mv Philosophers-COL-000200 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;