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.r293-tall-167873945100220.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 itstools
Input is Philosophers-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945100220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 98K Feb 25 13:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 597K Feb 25 13:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 326K Feb 25 13:10 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 53K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 210K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 145K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 860K Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 323K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K 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 215K 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-000100-LTLFireability-00
FORMULA_NAME Philosophers-PT-000100-LTLFireability-01
FORMULA_NAME Philosophers-PT-000100-LTLFireability-02
FORMULA_NAME Philosophers-PT-000100-LTLFireability-03
FORMULA_NAME Philosophers-PT-000100-LTLFireability-04
FORMULA_NAME Philosophers-PT-000100-LTLFireability-05
FORMULA_NAME Philosophers-PT-000100-LTLFireability-06
FORMULA_NAME Philosophers-PT-000100-LTLFireability-07
FORMULA_NAME Philosophers-PT-000100-LTLFireability-08
FORMULA_NAME Philosophers-PT-000100-LTLFireability-09
FORMULA_NAME Philosophers-PT-000100-LTLFireability-10
FORMULA_NAME Philosophers-PT-000100-LTLFireability-11
FORMULA_NAME Philosophers-PT-000100-LTLFireability-12
FORMULA_NAME Philosophers-PT-000100-LTLFireability-13
FORMULA_NAME Philosophers-PT-000100-LTLFireability-14
FORMULA_NAME Philosophers-PT-000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678807294956

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 15:21:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 15:21:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:21:36] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-14 15:21:36] [INFO ] Transformed 500 places.
[2023-03-14 15:21:36] [INFO ] Transformed 500 transitions.
[2023-03-14 15:21:36] [INFO ] Found NUPN structural information;
[2023-03-14 15:21:36] [INFO ] Parsed PT model containing 500 places and 500 transitions and 1600 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 177 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 15:21:37] [INFO ] Computed 200 place invariants in 20 ms
[2023-03-14 15:21:37] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-14 15:21:37] [INFO ] Invariant cache hit.
[2023-03-14 15:21:37] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-14 15:21:37] [INFO ] Invariant cache hit.
[2023-03-14 15:21:37] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1205 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2023-03-14 15:21:38] [INFO ] Flatten gal took : 73 ms
[2023-03-14 15:21:38] [INFO ] Flatten gal took : 45 ms
[2023-03-14 15:21:38] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 5856 steps, including 1 resets, run visited all 21 properties in 148 ms. (steps per millisecond=39 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:39] [INFO ] Invariant cache hit.
[2023-03-14 15:21:39] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-14 15:21:39] [INFO ] Invariant cache hit.
[2023-03-14 15:21:39] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-14 15:21:39] [INFO ] Invariant cache hit.
[2023-03-14 15:21:40] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s452 1) (EQ s387 1) (EQ s448 1) (EQ s460 1) (EQ s395 1) (EQ s456 1) (EQ s468 1) (EQ s464 1) (EQ s415 1) (EQ s476 1) (EQ s472 1) (EQ s423 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2224 ms.
Product exploration explored 100000 steps with 33333 reset in 2154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000100-LTLFireability-00 finished in 6059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 29 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:45] [INFO ] Invariant cache hit.
[2023-03-14 15:21:45] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-14 15:21:45] [INFO ] Invariant cache hit.
[2023-03-14 15:21:45] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-14 15:21:45] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-14 15:21:45] [INFO ] Invariant cache hit.
[2023-03-14 15:21:46] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 870 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s44 0) (EQ s150 0)) (OR (EQ s65 0) (EQ s172 0)) (OR (EQ s38 0) (EQ s131 0)) (OR (EQ s0 0) (EQ s94 0)) (OR (EQ s11 0) (EQ s114 0)) (OR (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 812 ms.
Stack based approach found an accepted trace after 637 steps with 0 reset with depth 638 and stack size 638 in 6 ms.
FORMULA Philosophers-PT-000100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-02 finished in 1760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)||G((G((G(p3) U p0))||p2)))))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:47] [INFO ] Invariant cache hit.
[2023-03-14 15:21:47] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-14 15:21:47] [INFO ] Invariant cache hit.
[2023-03-14 15:21:47] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-14 15:21:47] [INFO ] Invariant cache hit.
[2023-03-14 15:21:47] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p3), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=(OR p0 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=7 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (AND (EQ s44 1) (EQ s150 1)) (AND (EQ s65 1) (EQ s172 1)) (AND (EQ s38 1) (EQ s131 1)) (AND (EQ s0 1) (EQ s94 1)) (AND (EQ s11 1) (EQ s114 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2193 steps with 3 reset in 62 ms.
FORMULA Philosophers-PT-000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-03 finished in 1191 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(!p0))||G((p0 U p1)))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:48] [INFO ] Invariant cache hit.
[2023-03-14 15:21:48] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-14 15:21:48] [INFO ] Invariant cache hit.
[2023-03-14 15:21:48] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-14 15:21:48] [INFO ] Invariant cache hit.
[2023-03-14 15:21:49] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) p0), p0, (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(OR (AND (EQ s28 1) (EQ s133 1)) (AND (EQ s87 1) (EQ s204 1)) (AND (EQ s64 1) (EQ s158 1)) (AND (EQ s74 1) (EQ s164 1)) (AND (EQ s37 1) (EQ s129 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 865 ms.
Stack based approach found an accepted trace after 1196 steps with 1 reset with depth 607 and stack size 607 in 13 ms.
FORMULA Philosophers-PT-000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-05 finished in 1870 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(!p1))||(!p1&&X(!p1))))||p0)))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:50] [INFO ] Invariant cache hit.
[2023-03-14 15:21:50] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-14 15:21:50] [INFO ] Invariant cache hit.
[2023-03-14 15:21:50] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-14 15:21:50] [INFO ] Invariant cache hit.
[2023-03-14 15:21:50] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, p1, p1]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s452 1) (EQ s387 1) (EQ s448 1) (EQ s460 1) (EQ s395 1) (EQ s456 1) (EQ s468 1) (EQ s464 1) (EQ s415 1) (EQ s476 1) (EQ s472 1) (EQ s423 1) (EQ...], 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]]
Product exploration explored 100000 steps with 340 reset in 946 ms.
Stack based approach found an accepted trace after 410 steps with 3 reset with depth 405 and stack size 405 in 5 ms.
FORMULA Philosophers-PT-000100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-06 finished in 1938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G((X(p1) U p1))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:21:52] [INFO ] Invariant cache hit.
[2023-03-14 15:21:52] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-14 15:21:52] [INFO ] Invariant cache hit.
[2023-03-14 15:21:52] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-14 15:21:52] [INFO ] Invariant cache hit.
[2023-03-14 15:21:52] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 741 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=6, aps=[p0:(OR (AND (EQ s28 1) (EQ s133 1)) (AND (EQ s87 1) (EQ s204 1)) (AND (EQ s64 1) (EQ s158 1)) (AND (EQ s74 1) (EQ s164 1)) (AND (EQ s37 1) (EQ s129 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3077 ms.
Product exploration explored 100000 steps with 33333 reset in 3200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000100-LTLFireability-07 finished in 8085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(p1&&X((p0&&F(p2))))))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 15:22:00] [INFO ] Invariant cache hit.
[2023-03-14 15:22:00] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-14 15:22:00] [INFO ] Invariant cache hit.
[2023-03-14 15:22:00] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-14 15:22:00] [INFO ] Invariant cache hit.
[2023-03-14 15:22:01] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 3}]], initial=5, aps=[p2:(NEQ s452 1), p0:(OR (AND (EQ s115 1) (EQ s296 1)) (AND (EQ s148 1) (EQ s270 1))), p1:(NEQ s417 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-08 finished in 1208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(X(X(G(p1))))))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 404 transition count 404
Applied a total of 192 rules in 41 ms. Remains 404 /500 variables (removed 96) and now considering 404/500 (removed 96) transitions.
// Phase 1: matrix 404 rows 404 cols
[2023-03-14 15:22:01] [INFO ] Computed 200 place invariants in 8 ms
[2023-03-14 15:22:01] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 15:22:01] [INFO ] Invariant cache hit.
[2023-03-14 15:22:01] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-14 15:22:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 15:22:02] [INFO ] Invariant cache hit.
[2023-03-14 15:22:02] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/500 places, 404/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 868 ms. Remains : 404/500 places, 404/500 transitions.
Stuttering acceptance computed with spot in 1099 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={0, 1} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 6}, { cond=p0, acceptance={1} source=3 dest: 7}, { cond=p0, acceptance={0, 1} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 6}, { cond=p0, acceptance={1} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 9}, { cond=p0, acceptance={1} source=5 dest: 10}, { cond=p0, acceptance={0, 1} source=5 dest: 11}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 12}, { cond=p0, acceptance={1} source=6 dest: 13}, { cond=p0, acceptance={0, 1} source=6 dest: 14}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 12}, { cond=p0, acceptance={1} source=7 dest: 13}], [{ cond=(NOT p0), acceptance={0, 1} source=8 dest: 15}, { cond=p0, acceptance={1} source=8 dest: 16}, { cond=p0, acceptance={0, 1} source=8 dest: 17}], [{ cond=(NOT p0), acceptance={0, 1} source=9 dest: 18}, { cond=p0, acceptance={1} source=9 dest: 19}, { cond=p0, acceptance={0, 1} source=9 dest: 20}], [{ cond=(NOT p0), acceptance={0, 1} source=10 dest: 18}, { cond=p0, acceptance={1} source=10 dest: 19}], [{ cond=(NOT p0), acceptance={0, 1} source=11 dest: 21}, { cond=p0, acceptance={1} source=11 dest: 22}, { cond=p0, acceptance={0, 1} source=11 dest: 23}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=12 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=12 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=12 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=12 dest: 12}, { cond=(AND p0 p1), acceptance={} source=12 dest: 13}, { cond=(AND p0 p1), acceptance={0} source=12 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=13 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=13 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 12}, { cond=(AND p0 p1), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=14 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=14 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=14 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=14 dest: 15}, { cond=(AND p0 p1), acceptance={} source=14 dest: 16}, { cond=(AND p0 p1), acceptance={0} source=14 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=15 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={1} source=15 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=15 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={0} source=15 dest: 18}, { cond=(AND p0 p1), acceptance={} source=15 dest: 19}, { cond=(AND p0 p1), acceptance={0} source=15 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=16 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={1} source=16 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=16 dest: 18}, { cond=(AND p0 p1), acceptance={} source=16 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=17 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={1} source=17 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=17 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={0} source=17 dest: 21}, { cond=(AND p0 p1), acceptance={} source=17 dest: 22}, { cond=(AND p0 p1), acceptance={0} source=17 dest: 23}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=18 dest: 12}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=18 dest: 12}, { cond=(AND p0 p1), acceptance={} source=18 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={1} source=18 dest: 13}, { cond=(AND p0 p1), acceptance={0} source=18 dest: 14}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=18 dest: 14}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=19 dest: 12}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=19 dest: 12}, { cond=(AND p0 p1), acceptance={} source=19 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={1} source=19 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=20 dest: 15}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=20 dest: 15}, { cond=(AND p0 p1), acceptance={} source=20 dest: 16}, { cond=(AND p0 (NOT p1)), acceptance={1} source=20 dest: 16}, { cond=(AND p0 p1), acceptance={0} source=20 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=20 dest: 17}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=21 dest: 18}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=21 dest: 18}, { cond=(AND p0 p1), acceptance={} source=21 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={1} source=21 dest: 19}, { cond=(AND p0 p1), acceptance={0} source=21 dest: 20}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=21 dest: 20}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=22 dest: 18}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=22 dest: 18}, { cond=(AND p0 p1), acceptance={} source=22 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={1} source=22 dest: 19}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=23 dest: 21}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=23 dest: 21}, { cond=(AND p0 p1), acceptance={} source=23 dest: 22}, { cond=(AND p0 (NOT p1)), acceptance={1} source=23 dest: 22}, { cond=(AND p0 p1), acceptance={0} source=23 dest: 23}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=23 dest: 23}]], initial=0, aps=[p0:(AND (EQ s72 1) (EQ s181 1) (EQ s98 1) (EQ s199 1)), p1:(AND (EQ s72 1) (EQ s181 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 13970 steps with 0 reset in 75 ms.
FORMULA Philosophers-PT-000100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-09 finished in 2075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 404 transition count 404
Applied a total of 192 rules in 28 ms. Remains 404 /500 variables (removed 96) and now considering 404/500 (removed 96) transitions.
// Phase 1: matrix 404 rows 404 cols
[2023-03-14 15:22:03] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-14 15:22:03] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 15:22:03] [INFO ] Invariant cache hit.
[2023-03-14 15:22:04] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-14 15:22:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 15:22:04] [INFO ] Invariant cache hit.
[2023-03-14 15:22:04] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/500 places, 404/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 404/500 places, 404/500 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s403 1) (NOT (AND (EQ s139 1) (EQ s225 1) (EQ s402 1)))), p0:(AND (EQ s139 1) (EQ s225 1) (EQ s402 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29 reset in 567 ms.
Stack based approach found an accepted trace after 30968 steps with 12 reset with depth 2781 and stack size 2653 in 203 ms.
FORMULA Philosophers-PT-000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-10 finished in 1708 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((X(X(F(p2)))&&p1))&&p0)))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 15:22:05] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 15:22:05] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-14 15:22:05] [INFO ] Invariant cache hit.
[2023-03-14 15:22:05] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-14 15:22:05] [INFO ] Invariant cache hit.
[2023-03-14 15:22:05] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (NEQ s109 1) (NEQ s339 1)), p1:(AND (EQ s84 1) (EQ s185 1)), p0:(AND (EQ s109 1) (EQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-11 finished in 1212 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))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 402 transition count 402
Applied a total of 196 rules in 25 ms. Remains 402 /500 variables (removed 98) and now considering 402/500 (removed 98) transitions.
// Phase 1: matrix 402 rows 402 cols
[2023-03-14 15:22:06] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-14 15:22:06] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-14 15:22:06] [INFO ] Invariant cache hit.
[2023-03-14 15:22:06] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-14 15:22:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 15:22:06] [INFO ] Invariant cache hit.
[2023-03-14 15:22:07] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/500 places, 402/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 852 ms. Remains : 402/500 places, 402/500 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27829 steps with 23 reset in 187 ms.
FORMULA Philosophers-PT-000100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-14 finished in 1092 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(!p1)))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 15:22:07] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 15:22:07] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-14 15:22:07] [INFO ] Invariant cache hit.
[2023-03-14 15:22:08] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-14 15:22:08] [INFO ] Invariant cache hit.
[2023-03-14 15:22:08] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 886 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, p1, p1, true]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s130 1) (EQ s319 1)), p0:(AND (EQ s38 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 279 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-15 finished in 1032 ms.
All properties solved by simple procedures.
Total runtime 32048 ms.

BK_STOP 1678807329547

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Philosophers-PT-000100, 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 r293-tall-167873945100220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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