Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
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 1678805745090

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:55:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:55:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:55:46] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-14 14:55:46] [INFO ] Transformed 2500 places.
[2023-03-14 14:55:46] [INFO ] Transformed 2500 transitions.
[2023-03-14 14:55:46] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 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 29 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 14:55:47] [INFO ] Computed 1000 place invariants in 41 ms
[2023-03-14 14:55:48] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-14 14:55:48] [INFO ] Invariant cache hit.
[2023-03-14 14:55:49] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2023-03-14 14:55:49] [INFO ] Invariant cache hit.
[2023-03-14 14:55:51] [INFO ] Dead Transitions using invariants and state equation in 1551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3634 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-14 14:55:51] [INFO ] Flatten gal took : 232 ms
[2023-03-14 14:55:52] [INFO ] Flatten gal took : 178 ms
[2023-03-14 14:55:52] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=13 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 934 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 901 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 14:55:56] [INFO ] Invariant cache hit.
[2023-03-14 14:55:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 202 ms returned sat
[2023-03-14 14:55:58] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:55:59] [INFO ] [Nat]Absence check using 1000 positive place invariants in 181 ms returned sat
[2023-03-14 14:56:02] [INFO ] After 2697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 14:56:03] [INFO ] After 3865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 868 ms.
[2023-03-14 14:56:04] [INFO ] After 5821ms 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 45 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 47 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-14 14:56:04] [INFO ] Invariant cache hit.
[2023-03-14 14:56:05] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-14 14:56:05] [INFO ] Invariant cache hit.
[2023-03-14 14:56:07] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
[2023-03-14 14:56:07] [INFO ] Invariant cache hit.
[2023-03-14 14:56:08] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3922 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 357 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 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-00 finished in 4366 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 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:56:09] [INFO ] Invariant cache hit.
[2023-03-14 14:56:10] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-14 14:56:10] [INFO ] Invariant cache hit.
[2023-03-14 14:56:12] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
[2023-03-14 14:56:12] [INFO ] Invariant cache hit.
[2023-03-14 14:56:13] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4642 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 88 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 6 reset in 2574 ms.
Stack based approach found an accepted trace after 6720 steps with 0 reset with depth 6721 and stack size 6721 in 256 ms.
FORMULA Philosophers-PT-000500-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-01 finished in 7592 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 193 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:56:16] [INFO ] Invariant cache hit.
[2023-03-14 14:56:17] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-14 14:56:17] [INFO ] Invariant cache hit.
[2023-03-14 14:56:19] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 3001 ms to find 0 implicit places.
[2023-03-14 14:56:19] [INFO ] Invariant cache hit.
[2023-03-14 14:56:21] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4666 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 8 reset in 2752 ms.
Stack based approach found an accepted trace after 6773 steps with 0 reset with depth 6774 and stack size 6774 in 218 ms.
FORMULA Philosophers-PT-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-02 finished in 7750 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 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:56:24] [INFO ] Invariant cache hit.
[2023-03-14 14:56:24] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-14 14:56:24] [INFO ] Invariant cache hit.
[2023-03-14 14:56:26] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2023-03-14 14:56:26] [INFO ] Invariant cache hit.
[2023-03-14 14:56:27] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3387 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 166 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 77470 steps with 31018 reset in 10003 ms.
Product exploration timeout after 75180 steps with 30056 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT 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 240 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 126 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 170 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 129 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 118 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 11 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:02] [INFO ] Invariant cache hit.
[2023-03-14 14:57:03] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-14 14:57:03] [INFO ] Invariant cache hit.
[2023-03-14 14:57:04] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2023-03-14 14:57:04] [INFO ] Invariant cache hit.
[2023-03-14 14:57:05] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3164 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 113 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 127 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 159 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 119 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 135 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 120 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 76900 steps with 30742 reset in 10001 ms.
Product exploration timeout after 74410 steps with 29677 reset in 10002 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 113 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 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:41] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-14 14:57:41] [INFO ] Invariant cache hit.
[2023-03-14 14:57:42] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1689 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 14 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:42] [INFO ] Invariant cache hit.
[2023-03-14 14:57:43] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-14 14:57:43] [INFO ] Invariant cache hit.
[2023-03-14 14:57:44] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-14 14:57:44] [INFO ] Invariant cache hit.
[2023-03-14 14:57:45] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3169 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 81605 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 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:57:46] [INFO ] Invariant cache hit.
[2023-03-14 14:57:46] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-14 14:57:46] [INFO ] Invariant cache hit.
[2023-03-14 14:57:49] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
[2023-03-14 14:57:49] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-14 14:57:49] [INFO ] Invariant cache hit.
[2023-03-14 14:57:50] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4502 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 92 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 2503 ms.
Stack based approach found an accepted trace after 4803 steps with 0 reset with depth 4804 and stack size 4804 in 189 ms.
FORMULA Philosophers-PT-000500-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-05 finished in 7327 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 407 ms. Remains 2004 /2500 variables (removed 496) and now considering 2004/2500 (removed 496) transitions.
// Phase 1: matrix 2004 rows 2004 cols
[2023-03-14 14:57:53] [INFO ] Computed 1000 place invariants in 12 ms
[2023-03-14 14:57:55] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2023-03-14 14:57:55] [INFO ] Invariant cache hit.
[2023-03-14 14:57:58] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned []
Implicit Place search using SMT with State Equation took 4168 ms to find 0 implicit places.
[2023-03-14 14:57:58] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-14 14:57:58] [INFO ] Invariant cache hit.
[2023-03-14 14:57:59] [INFO ] Dead Transitions using invariants and state equation in 1072 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 5689 ms. Remains : 2004/2500 places, 2004/2500 transitions.
Stuttering acceptance computed with spot in 87 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 1695 ms.
Stack based approach found an accepted trace after 543 steps with 0 reset with depth 544 and stack size 544 in 64 ms.
FORMULA Philosophers-PT-000500-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-09 finished in 7561 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 66 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 14:58:01] [INFO ] Computed 1000 place invariants in 18 ms
[2023-03-14 14:58:02] [INFO ] Implicit Places using invariants in 1387 ms returned []
[2023-03-14 14:58:02] [INFO ] Invariant cache hit.
[2023-03-14 14:58:05] [INFO ] Implicit Places using invariants and state equation in 2859 ms returned []
Implicit Place search using SMT with State Equation took 4248 ms to find 0 implicit places.
[2023-03-14 14:58:05] [INFO ] Invariant cache hit.
[2023-03-14 14:58:06] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 257 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 549 steps with 172 reset in 62 ms.
FORMULA Philosophers-PT-000500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-10 finished in 6102 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 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:58:07] [INFO ] Invariant cache hit.
[2023-03-14 14:58:08] [INFO ] Implicit Places using invariants in 1377 ms returned []
[2023-03-14 14:58:08] [INFO ] Invariant cache hit.
[2023-03-14 14:58:11] [INFO ] Implicit Places using invariants and state equation in 2904 ms returned []
Implicit Place search using SMT with State Equation took 4283 ms to find 0 implicit places.
[2023-03-14 14:58:11] [INFO ] Invariant cache hit.
[2023-03-14 14:58:12] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5783 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 203 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 337 steps with 34 reset in 44 ms.
FORMULA Philosophers-PT-000500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-13 finished in 6054 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 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:58:13] [INFO ] Invariant cache hit.
[2023-03-14 14:58:14] [INFO ] Implicit Places using invariants in 1382 ms returned []
[2023-03-14 14:58:14] [INFO ] Invariant cache hit.
[2023-03-14 14:58:17] [INFO ] Implicit Places using invariants and state equation in 2865 ms returned []
Implicit Place search using SMT with State Equation took 4250 ms to find 0 implicit places.
[2023-03-14 14:58:17] [INFO ] Invariant cache hit.
[2023-03-14 14:58:18] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5764 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 213 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 84370 steps with 380 reset in 10002 ms.
Stack based approach found an accepted trace after 49442 steps with 216 reset with depth 49 and stack size 49 in 5947 ms.
FORMULA Philosophers-PT-000500-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-14 finished in 21957 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 63 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:58:35] [INFO ] Invariant cache hit.
[2023-03-14 14:58:36] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2023-03-14 14:58:36] [INFO ] Invariant cache hit.
[2023-03-14 14:58:39] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
[2023-03-14 14:58:39] [INFO ] Invariant cache hit.
[2023-03-14 14:58:40] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5862 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 160 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 83250 steps with 406 reset in 10001 ms.
Product exploration timeout after 83730 steps with 355 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 p2 p0 (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 545 steps, including 0 resets, run visited all 1 properties in 57 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-14 14:59:16] [INFO ] Invariant cache hit.
[2023-03-14 14:59:22] [INFO ] [Real]Absence check using 1000 positive place invariants in 3139 ms returned sat
[2023-03-14 14:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:59:31] [INFO ] [Real]Absence check using state equation in 8978 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 63 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 14:59:31] [INFO ] Invariant cache hit.
[2023-03-14 14:59:32] [INFO ] Implicit Places using invariants in 1396 ms returned []
[2023-03-14 14:59:32] [INFO ] Invariant cache hit.
[2023-03-14 14:59:35] [INFO ] Implicit Places using invariants and state equation in 2930 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
[2023-03-14 14:59:35] [INFO ] Invariant cache hit.
[2023-03-14 14:59:37] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5859 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 : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 367 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-14 14:59:52] [INFO ] Invariant cache hit.
[2023-03-14 14:59:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 3151 ms returned sat
[2023-03-14 14:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 15:00:07] [INFO ] [Real]Absence check using state equation in 8979 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration timeout after 86700 steps with 380 reset in 10001 ms.
Product exploration timeout after 82590 steps with 369 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 498 places in 0 ms
Iterating global reduction 0 with 498 rules applied. Total rules applied 498 place count 2500 transition count 2500
Deduced a syphon composed of 498 places in 1 ms
Applied a total of 498 rules in 332 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:00:27] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 15:00:27] [INFO ] Computed 1000 place invariants in 19 ms
[2023-03-14 15:00:29] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2500/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1919 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2 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 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 15:00:29] [INFO ] Computed 1000 place invariants in 16 ms
[2023-03-14 15:00:30] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2023-03-14 15:00:30] [INFO ] Invariant cache hit.
[2023-03-14 15:00:33] [INFO ] Implicit Places using invariants and state equation in 3070 ms returned []
Implicit Place search using SMT with State Equation took 4537 ms to find 0 implicit places.
[2023-03-14 15:00:33] [INFO ] Invariant cache hit.
[2023-03-14 15:00:35] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6154 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLFireability-15 finished in 120465 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)))'
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)))'
[2023-03-14 15:00:35] [INFO ] Flatten gal took : 93 ms
[2023-03-14 15:00:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2023-03-14 15:00:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 18 ms.
Total runtime 289370 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-000500
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Philosophers-PT-000500-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000500-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678806234619

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type EXCL) for 3 Philosophers-PT-000500-LTLFireability-15
lola: time limit : 861 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for Philosophers-PT-000500-LTLFireability-15
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 6 (type EXCL) for 3 Philosophers-PT-000500-LTLFireability-15
lola: time limit : 1149 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for Philosophers-PT-000500-LTLFireability-15
lola: result : true
lola: markings : 1001
lola: fired transitions : 1000
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 3 Philosophers-PT-000500-LTLFireability-15
lola: time limit : 1723 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for Philosophers-PT-000500-LTLFireability-15
lola: result : false
lola: markings : 103
lola: fired transitions : 103
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-000500-LTLFireability-04
lola: time limit : 3447 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3447 1/32 Philosophers-PT-000500-LTLFireability-04 34510 m, 6902 m/sec, 35104 t fired, .

Time elapsed: 157 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3447 2/32 Philosophers-PT-000500-LTLFireability-04 82204 m, 9538 m/sec, 85858 t fired, .

Time elapsed: 162 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3447 3/32 Philosophers-PT-000500-LTLFireability-04 128417 m, 9242 m/sec, 137869 t fired, .

Time elapsed: 167 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3447 4/32 Philosophers-PT-000500-LTLFireability-04 175268 m, 9370 m/sec, 193988 t fired, .

Time elapsed: 172 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3447 4/32 Philosophers-PT-000500-LTLFireability-04 216503 m, 8247 m/sec, 246883 t fired, .

Time elapsed: 177 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3447 5/32 Philosophers-PT-000500-LTLFireability-04 260885 m, 8876 m/sec, 308470 t fired, .

Time elapsed: 182 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3447 6/32 Philosophers-PT-000500-LTLFireability-04 303450 m, 8513 m/sec, 372902 t fired, .

Time elapsed: 187 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-000500-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3447 7/32 Philosophers-PT-000500-LTLFireability-04 342931 m, 7896 m/sec, 439510 t fired, .

Time elapsed: 192 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for Philosophers-PT-000500-LTLFireability-04
lola: result : true
lola: markings : 375251
lola: fired transitions : 500000
lola: time used : 44.000000
lola: memory pages used : 7
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-000500-LTLFireability-04: LTL true LTL model checker
Philosophers-PT-000500-LTLFireability-15: CONJ false LTL model checker


Time elapsed: 197 secs. Pages in use: 7

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-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 r295-tall-167873947600236"
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 ;