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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 716K Feb 25 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Feb 25 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 379K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 13:29 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 214K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 840K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 184K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 850K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 234K Feb 25 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-PT-000500-LTLFireability-00
FORMULA_NAME Philosophers-PT-000500-LTLFireability-01
FORMULA_NAME Philosophers-PT-000500-LTLFireability-02
FORMULA_NAME Philosophers-PT-000500-LTLFireability-03
FORMULA_NAME Philosophers-PT-000500-LTLFireability-04
FORMULA_NAME Philosophers-PT-000500-LTLFireability-05
FORMULA_NAME Philosophers-PT-000500-LTLFireability-06
FORMULA_NAME Philosophers-PT-000500-LTLFireability-07
FORMULA_NAME Philosophers-PT-000500-LTLFireability-08
FORMULA_NAME Philosophers-PT-000500-LTLFireability-09
FORMULA_NAME Philosophers-PT-000500-LTLFireability-10
FORMULA_NAME Philosophers-PT-000500-LTLFireability-11
FORMULA_NAME Philosophers-PT-000500-LTLFireability-12
FORMULA_NAME Philosophers-PT-000500-LTLFireability-13
FORMULA_NAME Philosophers-PT-000500-LTLFireability-14
FORMULA_NAME Philosophers-PT-000500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679470736381

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-PT-000500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:38:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:38:58] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-22 07:38:58] [INFO ] Transformed 2500 places.
[2023-03-22 07:38:58] [INFO ] Transformed 2500 transitions.
[2023-03-22 07:38:58] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000500-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 38 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 07:38:59] [INFO ] Computed 1000 place invariants in 40 ms
[2023-03-22 07:39:00] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-22 07:39:00] [INFO ] Invariant cache hit.
[2023-03-22 07:39:01] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 2386 ms to find 0 implicit places.
[2023-03-22 07:39:01] [INFO ] Invariant cache hit.
[2023-03-22 07:39:03] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4199 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-22 07:39:04] [INFO ] Flatten gal took : 269 ms
[2023-03-22 07:39:04] [INFO ] Flatten gal took : 199 ms
[2023-03-22 07:39:05] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 962 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:39:09] [INFO ] Invariant cache hit.
[2023-03-22 07:39:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 191 ms returned sat
[2023-03-22 07:39:11] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:39:12] [INFO ] [Nat]Absence check using 1000 positive place invariants in 207 ms returned sat
[2023-03-22 07:39:16] [INFO ] After 3147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:39:17] [INFO ] After 4357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 963 ms.
[2023-03-22 07:39:18] [INFO ] After 6482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 3 properties in 48 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 51 ms.
FORMULA Philosophers-PT-000500-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X(p1) U (p1&&G(F(p2))))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:18] [INFO ] Invariant cache hit.
[2023-03-22 07:39:19] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-22 07:39:19] [INFO ] Invariant cache hit.
[2023-03-22 07:39:21] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2023-03-22 07:39:21] [INFO ] Invariant cache hit.
[2023-03-22 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4712 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s712 1) (GEQ s1165 1)) (AND (GEQ s832 1) (GEQ s1335 1)) (AND (GEQ s937 1) (GEQ s1490 1)) (AND (GEQ s680 1) (GEQ s1074 1)) (AND (GEQ s639 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 165 steps with 4 reset in 78 ms.
FORMULA Philosophers-PT-000500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-00 finished in 5200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 128 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:24] [INFO ] Invariant cache hit.
[2023-03-22 07:39:25] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-22 07:39:25] [INFO ] Invariant cache hit.
[2023-03-22 07:39:27] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 3667 ms to find 0 implicit places.
[2023-03-22 07:39:27] [INFO ] Invariant cache hit.
[2023-03-22 07:39:29] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5571 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s988 1) (LT s1977 1)) (OR (LT s940 1) (LT s1792 1)) (OR (LT s662 1) (LT s1732 1)) (OR (LT s928 1) (LT s2030 1)) (OR (LT s557 1) (LT s1447 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 2735 ms.
Stack based approach found an accepted trace after 8437 steps with 0 reset with depth 8438 and stack size 8438 in 319 ms.
FORMULA Philosophers-PT-000500-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-01 finished in 8772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(F(!p0)&&X(p0))))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 196 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:32] [INFO ] Invariant cache hit.
[2023-03-22 07:39:33] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-22 07:39:33] [INFO ] Invariant cache hit.
[2023-03-22 07:39:36] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
[2023-03-22 07:39:36] [INFO ] Invariant cache hit.
[2023-03-22 07:39:38] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5572 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s616 1)) (AND (GEQ s375 1) (GEQ s847 1)) (AND (GEQ s287 1) (GEQ s784 1)) (AND (GEQ s168 1) (GEQ s693 1)) (AND (GEQ s456 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9 reset in 2786 ms.
Stack based approach found an accepted trace after 10780 steps with 0 reset with depth 10781 and stack size 10781 in 341 ms.
FORMULA Philosophers-PT-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-02 finished in 8822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p2)||p1))||p0)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 19 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:41] [INFO ] Invariant cache hit.
[2023-03-22 07:39:42] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-22 07:39:42] [INFO ] Invariant cache hit.
[2023-03-22 07:39:43] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
[2023-03-22 07:39:43] [INFO ] Invariant cache hit.
[2023-03-22 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 1760 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3869 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s712 1) (GEQ s1165 1)) (AND (GEQ s832 1) (GEQ s1335 1)) (AND (GEQ s937 1) (GEQ s1490 1)) (AND (GEQ s680 1) (GEQ s1074 1)) (AND (GEQ s639 ...], 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 timeout after 75840 steps with 30310 reset in 10004 ms.
Product exploration timeout after 73530 steps with 29457 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 22 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:40:21] [INFO ] Invariant cache hit.
[2023-03-22 07:40:21] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-22 07:40:21] [INFO ] Invariant cache hit.
[2023-03-22 07:40:23] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
[2023-03-22 07:40:23] [INFO ] Invariant cache hit.
[2023-03-22 07:40:24] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3790 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 75540 steps with 30216 reset in 10001 ms.
Product exploration timeout after 73140 steps with 29248 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:01] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-22 07:41:01] [INFO ] Invariant cache hit.
[2023-03-22 07:41:03] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2036 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 12 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:03] [INFO ] Invariant cache hit.
[2023-03-22 07:41:03] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-22 07:41:03] [INFO ] Invariant cache hit.
[2023-03-22 07:41:05] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2023-03-22 07:41:05] [INFO ] Invariant cache hit.
[2023-03-22 07:41:06] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3826 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 85845 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((F(G(p0))&&(G(p2)||p1))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:07] [INFO ] Invariant cache hit.
[2023-03-22 07:41:08] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2023-03-22 07:41:08] [INFO ] Invariant cache hit.
[2023-03-22 07:41:10] [INFO ] Implicit Places using invariants and state equation in 2458 ms returned []
Implicit Place search using SMT with State Equation took 3525 ms to find 0 implicit places.
[2023-03-22 07:41:11] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-22 07:41:11] [INFO ] Invariant cache hit.
[2023-03-22 07:41:12] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5582 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-05 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s399 1) (GEQ s842 1)) (AND (GEQ s242 1) (GEQ s706 1)) (AND (GEQ s137 1) (GEQ s600 1)) (AND (GEQ s298 1) (GEQ s792 1)) (AND (GEQ s421 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2603 ms.
Stack based approach found an accepted trace after 3266 steps with 0 reset with depth 3267 and stack size 3267 in 159 ms.
FORMULA Philosophers-PT-000500-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-05 finished in 8510 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(G(p1)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 1 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 0 with 992 rules applied. Total rules applied 992 place count 2004 transition count 2004
Applied a total of 992 rules in 440 ms. Remains 2004 /2500 variables (removed 496) and now considering 2004/2500 (removed 496) transitions.
// Phase 1: matrix 2004 rows 2004 cols
[2023-03-22 07:41:16] [INFO ] Computed 1000 place invariants in 11 ms
[2023-03-22 07:41:17] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2023-03-22 07:41:17] [INFO ] Invariant cache hit.
[2023-03-22 07:41:21] [INFO ] Implicit Places using invariants and state equation in 3337 ms returned []
Implicit Place search using SMT with State Equation took 4862 ms to find 0 implicit places.
[2023-03-22 07:41:21] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-22 07:41:21] [INFO ] Invariant cache hit.
[2023-03-22 07:41:22] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2004/2500 places, 2004/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6749 ms. Remains : 2004/2500 places, 2004/2500 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s849 1) (GEQ s1284 1)), p1:(AND (GEQ s981 1) (GEQ s1929 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 1970 ms.
Stack based approach found an accepted trace after 1375 steps with 0 reset with depth 1376 and stack size 1374 in 115 ms.
FORMULA Philosophers-PT-000500-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-09 finished in 8990 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 ((X(G(p2))&&p1) U X(p3))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 07:41:24] [INFO ] Computed 1000 place invariants in 18 ms
[2023-03-22 07:41:26] [INFO ] Implicit Places using invariants in 1760 ms returned []
[2023-03-22 07:41:26] [INFO ] Invariant cache hit.
[2023-03-22 07:41:30] [INFO ] Implicit Places using invariants and state equation in 3551 ms returned []
Implicit Place search using SMT with State Equation took 5313 ms to find 0 implicit places.
[2023-03-22 07:41:30] [INFO ] Invariant cache hit.
[2023-03-22 07:41:32] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7221 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (NOT p2), (OR (NOT p3) (NOT p2)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=0 dest: 6}], [{ cond=(AND p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 p2), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0 (NOT p3)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s279 1) (GEQ s718 1)), p0:(AND (GEQ s279 1) (GEQ s718 1)), p3:(OR (AND (GEQ s610 1) (GEQ s1597 1)) (AND (GEQ s81 1) (GEQ s609 1))), p2:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 834 steps with 294 reset in 91 ms.
FORMULA Philosophers-PT-000500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-10 finished in 7637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(F((p2||G(p3)))||G(!p1)))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 113 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:32] [INFO ] Invariant cache hit.
[2023-03-22 07:41:34] [INFO ] Implicit Places using invariants in 1680 ms returned []
[2023-03-22 07:41:34] [INFO ] Invariant cache hit.
[2023-03-22 07:41:37] [INFO ] Implicit Places using invariants and state equation in 3400 ms returned []
Implicit Place search using SMT with State Equation took 5082 ms to find 0 implicit places.
[2023-03-22 07:41:37] [INFO ] Invariant cache hit.
[2023-03-22 07:41:39] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6965 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s512 1)), p0:(AND (GEQ s389 1) (GEQ s951 1)), p2:(AND (GEQ s87 1) (GEQ s624 1)), p3:(AND (GEQ s373 1) (GEQ s873 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2557 steps with 632 reset in 217 ms.
FORMULA Philosophers-PT-000500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-13 finished in 7423 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) U p1) U X((F(G(p2))&&G(p1)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:39] [INFO ] Invariant cache hit.
[2023-03-22 07:41:41] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2023-03-22 07:41:41] [INFO ] Invariant cache hit.
[2023-03-22 07:41:45] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 5237 ms to find 0 implicit places.
[2023-03-22 07:41:45] [INFO ] Invariant cache hit.
[2023-03-22 07:41:47] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7149 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(GEQ s2485 1), p0:(AND (GEQ s219 1) (GEQ s748 1)), p2:(AND (GEQ s580 1) (GEQ s1041 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 83290 steps with 373 reset in 10001 ms.
Product exploration timeout after 79140 steps with 360 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 885 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-22 07:42:24] [INFO ] Invariant cache hit.
[2023-03-22 07:42:25] [INFO ] [Real]Absence check using 1000 positive place invariants in 222 ms returned sat
[2023-03-22 07:42:26] [INFO ] After 2021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:42:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 210 ms returned sat
[2023-03-22 07:42:28] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:42:29] [INFO ] After 1943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 309 ms.
[2023-03-22 07:42:29] [INFO ] After 2942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 323 steps, including 0 resets, run visited all 4 properties in 27 ms. (steps per millisecond=11 )
Parikh walk visited 4 properties in 29 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 1119 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
[2023-03-22 07:42:31] [INFO ] Invariant cache hit.
[2023-03-22 07:42:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 213 ms returned unsat
Proved EG (NOT p1)
[2023-03-22 07:42:34] [INFO ] Invariant cache hit.
[2023-03-22 07:42:41] [INFO ] [Real]Absence check using 1000 positive place invariants in 3028 ms returned sat
[2023-03-22 07:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:42:49] [INFO ] [Real]Absence check using state equation in 8664 ms returned unknown
Could not prove EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT (AND p0 (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 961 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000500-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000500-LTLFireability-14 finished in 70902 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&&X(F(p1))))&&F(p2)))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:42:50] [INFO ] Invariant cache hit.
[2023-03-22 07:42:52] [INFO ] Implicit Places using invariants in 1727 ms returned []
[2023-03-22 07:42:52] [INFO ] Invariant cache hit.
[2023-03-22 07:42:56] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 5213 ms to find 0 implicit places.
[2023-03-22 07:42:56] [INFO ] Invariant cache hit.
[2023-03-22 07:42:57] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7056 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s109 1) (GEQ s581 1)) (GEQ s2296 1)), p0:(LT s2316 1), p1:(OR (LT s109 1) (LT s581 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 86520 steps with 359 reset in 10002 ms.
Stack based approach found an accepted trace after 34750 steps with 146 reset with depth 197 and stack size 197 in 4218 ms.
FORMULA Philosophers-PT-000500-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-15 finished in 21497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p2)||p1))||p0)))'
[2023-03-22 07:43:12] [INFO ] Flatten gal took : 104 ms
[2023-03-22 07:43:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2023-03-22 07:43:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 11 ms.
Total runtime 254233 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1372/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-PT-000500-LTLFireability-04

BK_STOP 1679470993917

--------------------
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
ltl formula name Philosophers-PT-000500-LTLFireability-04
ltl formula formula --ltl=/tmp/1372/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.080 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: stack overflow
pnml2lts-mc( 3/ 4), ** error **: stack overflow
pnml2lts-mc( 0/ 4), ** error **: stack overflow
pnml2lts-mc( 1/ 4), ** error **: stack overflow

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

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