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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 PhilosophersDyn-PT-10-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678825359108

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=PhilosophersDyn-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 20:22:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 20:22:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:22:42] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-14 20:22:42] [INFO ] Transformed 170 places.
[2023-03-14 20:22:42] [INFO ] Transformed 2310 transitions.
[2023-03-14 20:22:42] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-14 20:22:42] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:22:42] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:22:42] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:22:42] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-14 20:22:42] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 154 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 39 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 20:22:43] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:22:43] [INFO ] Computed 39 place invariants in 71 ms
[2023-03-14 20:22:44] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:22:44] [INFO ] Computed 39 place invariants in 54 ms
[2023-03-14 20:22:44] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-14 20:22:44] [INFO ] Invariant cache hit.
[2023-03-14 20:22:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:22:45] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2435 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 154 out of 170 places after structural reductions.
[2023-03-14 20:22:49] [INFO ] Flatten gal took : 279 ms
[2023-03-14 20:22:49] [INFO ] Flatten gal took : 220 ms
[2023-03-14 20:22:50] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 4071 ms. (steps per millisecond=2 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-14 20:22:54] [INFO ] Invariant cache hit.
[2023-03-14 20:22:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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(F((F(p1)&&p0))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:22:57] [INFO ] Invariant cache hit.
[2023-03-14 20:22:58] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
[2023-03-14 20:22:58] [INFO ] Invariant cache hit.
[2023-03-14 20:22:58] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-14 20:22:58] [INFO ] Invariant cache hit.
[2023-03-14 20:22:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:00] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2258 ms to find 0 implicit places.
[2023-03-14 20:23:00] [INFO ] Invariant cache hit.
[2023-03-14 20:23:01] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3561 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 744 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1)), p0:(AND (OR (LT s5 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][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 5 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-00 finished in 6608 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 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 240 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:02] [INFO ] Invariant cache hit.
[2023-03-14 20:23:02] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
[2023-03-14 20:23:02] [INFO ] Invariant cache hit.
[2023-03-14 20:23:03] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-14 20:23:03] [INFO ] Invariant cache hit.
[2023-03-14 20:23:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:10] [INFO ] Implicit Places using invariants and state equation in 6884 ms returned []
Implicit Place search using SMT with State Equation took 7203 ms to find 0 implicit places.
[2023-03-14 20:23:10] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-14 20:23:10] [INFO ] Invariant cache hit.
[2023-03-14 20:23:10] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8790 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 2695 ms :[p0]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11917 reset in 1214 ms.
Product exploration explored 100000 steps with 11911 reset in 1250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 988 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2023-03-14 20:23:17] [INFO ] Invariant cache hit.
[2023-03-14 20:23:17] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-14 20:23:17] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:23:18] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-14 20:23:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:18] [INFO ] [Real]Added 1010 Read/Feed constraints in 126 ms returned sat
[2023-03-14 20:23:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 276 ms.
[2023-03-14 20:23:18] [INFO ] Added : 0 causal constraints over 0 iterations in 417 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 161 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:19] [INFO ] Invariant cache hit.
[2023-03-14 20:23:19] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-14 20:23:19] [INFO ] Invariant cache hit.
[2023-03-14 20:23:20] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-14 20:23:20] [INFO ] Invariant cache hit.
[2023-03-14 20:23:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:26] [INFO ] Implicit Places using invariants and state equation in 6850 ms returned []
Implicit Place search using SMT with State Equation took 7164 ms to find 0 implicit places.
[2023-03-14 20:23:27] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 20:23:27] [INFO ] Invariant cache hit.
[2023-03-14 20:23:27] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8657 ms. Remains : 170/170 places, 1885/1885 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 : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-03-14 20:23:28] [INFO ] Invariant cache hit.
[2023-03-14 20:23:28] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:23:28] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-14 20:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:23:29] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-14 20:23:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:29] [INFO ] [Real]Added 1010 Read/Feed constraints in 111 ms returned sat
[2023-03-14 20:23:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 184 ms.
[2023-03-14 20:23:29] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 38 ms :[p0]
Product exploration explored 100000 steps with 11931 reset in 1087 ms.
Product exploration explored 100000 steps with 11925 reset in 1094 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 128 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:31] [INFO ] Invariant cache hit.
[2023-03-14 20:23:32] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-14 20:23:32] [INFO ] Invariant cache hit.
[2023-03-14 20:23:32] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-14 20:23:32] [INFO ] Invariant cache hit.
[2023-03-14 20:23:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:39] [INFO ] Implicit Places using invariants and state equation in 6897 ms returned []
Implicit Place search using SMT with State Equation took 7224 ms to find 0 implicit places.
[2023-03-14 20:23:39] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-14 20:23:39] [INFO ] Invariant cache hit.
[2023-03-14 20:23:40] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8664 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLFireability-01 finished in 38960 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((F(p1)||p0))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 126 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:41] [INFO ] Invariant cache hit.
[2023-03-14 20:23:41] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
[2023-03-14 20:23:41] [INFO ] Invariant cache hit.
[2023-03-14 20:23:41] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-14 20:23:41] [INFO ] Invariant cache hit.
[2023-03-14 20:23:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:44] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2023-03-14 20:23:44] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:23:44] [INFO ] Invariant cache hit.
[2023-03-14 20:23:44] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3865 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s27 1) (GEQ s39 1) (GEQ s66 1)) (AND (GEQ s71 1) (GEQ s92 1) (GEQ s96 1)) (AND (GEQ s120 1) (GEQ s148 1) (GEQ s159 1)) (AND (GEQ s26 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-04 finished in 3966 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 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:45] [INFO ] Invariant cache hit.
[2023-03-14 20:23:45] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2023-03-14 20:23:45] [INFO ] Invariant cache hit.
[2023-03-14 20:23:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-14 20:23:45] [INFO ] Invariant cache hit.
[2023-03-14 20:23:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:47] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
[2023-03-14 20:23:48] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-14 20:23:48] [INFO ] Invariant cache hit.
[2023-03-14 20:23:48] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3691 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1371 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-06 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 (NOT (AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1))) (OR (AND (...], 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 19284 reset in 4141 ms.
Product exploration explored 100000 steps with 19250 reset in 4065 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 939 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 20:24:03] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 20:24:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p0 (NOT p1))
Could not prove EG (AND p0 (NOT p1))
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 116 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:18] [INFO ] Invariant cache hit.
[2023-03-14 20:24:19] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-14 20:24:19] [INFO ] Invariant cache hit.
[2023-03-14 20:24:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-14 20:24:19] [INFO ] Invariant cache hit.
[2023-03-14 20:24:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:21] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2023-03-14 20:24:21] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 20:24:21] [INFO ] Invariant cache hit.
[2023-03-14 20:24:22] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3685 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-14 20:24:25] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 668 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19139 reset in 1532 ms.
Product exploration explored 100000 steps with 19331 reset in 1534 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 109 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:44] [INFO ] Invariant cache hit.
[2023-03-14 20:24:45] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2023-03-14 20:24:45] [INFO ] Invariant cache hit.
[2023-03-14 20:24:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-14 20:24:45] [INFO ] Invariant cache hit.
[2023-03-14 20:24:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:47] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2023-03-14 20:24:47] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 20:24:47] [INFO ] Invariant cache hit.
[2023-03-14 20:24:48] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3654 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLFireability-06 finished in 63300 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(G(((p2 U p3)||p1))))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:50] [INFO ] Invariant cache hit.
[2023-03-14 20:24:50] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-14 20:24:50] [INFO ] Invariant cache hit.
[2023-03-14 20:24:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-14 20:24:50] [INFO ] Invariant cache hit.
[2023-03-14 20:24:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:52] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-14 20:24:52] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-14 20:24:52] [INFO ] Invariant cache hit.
[2023-03-14 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2733 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-07 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=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR p1 p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (LT s4 1) (LT s21 1) (LT s22 1) (LT s86 1) (LT s41 1) (LT s72 1) (LT s136 1) (LT s11 1) (LT s58 1) (LT s46 1)) (AND (GEQ s27 1) (GEQ s39 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 9 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-07 finished in 5096 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&&F(G(((p2||G(!p0))&&p1))))))'
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:53] [INFO ] Invariant cache hit.
[2023-03-14 20:24:53] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
[2023-03-14 20:24:53] [INFO ] Invariant cache hit.
[2023-03-14 20:24:54] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-14 20:24:54] [INFO ] Invariant cache hit.
[2023-03-14 20:24:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:01] [INFO ] Implicit Places using invariants and state equation in 7177 ms returned []
Implicit Place search using SMT with State Equation took 7532 ms to find 0 implicit places.
[2023-03-14 20:25:01] [INFO ] Invariant cache hit.
[2023-03-14 20:25:01] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8715 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 3245 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s41 1), p2:(GEQ s58 1), p1:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s136 1) (GEQ s142 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-08 finished in 11985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:05] [INFO ] Invariant cache hit.
[2023-03-14 20:25:05] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2023-03-14 20:25:05] [INFO ] Invariant cache hit.
[2023-03-14 20:25:06] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-14 20:25:06] [INFO ] Invariant cache hit.
[2023-03-14 20:25:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:13] [INFO ] Implicit Places using invariants and state equation in 7132 ms returned []
Implicit Place search using SMT with State Equation took 7475 ms to find 0 implicit places.
[2023-03-14 20:25:13] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:25:13] [INFO ] Invariant cache hit.
[2023-03-14 20:25:14] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8830 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s35 1) (GEQ s81 1) (GEQ s118 1)), p0:(LT s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-09 finished in 8903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(!p1 U (p2||G(!p1)))))'
Support contains 15 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:14] [INFO ] Invariant cache hit.
[2023-03-14 20:25:14] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
[2023-03-14 20:25:14] [INFO ] Invariant cache hit.
[2023-03-14 20:25:15] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-14 20:25:15] [INFO ] Invariant cache hit.
[2023-03-14 20:25:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:21] [INFO ] Implicit Places using invariants and state equation in 6634 ms returned []
Implicit Place search using SMT with State Equation took 6922 ms to find 0 implicit places.
[2023-03-14 20:25:21] [INFO ] Invariant cache hit.
[2023-03-14 20:25:22] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8136 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s26 1) (GEQ s44 1) (GEQ s99 1) (NOT (AND (GEQ s38 1) (GEQ s108 1)))), p1:(AND (GEQ s38 1) (GEQ s108 1)), p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 77 steps with 8 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-10 finished in 8420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0||G(!p1)))&&F(!p1)) U X(p0)))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:22] [INFO ] Invariant cache hit.
[2023-03-14 20:25:23] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
[2023-03-14 20:25:23] [INFO ] Invariant cache hit.
[2023-03-14 20:25:23] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-14 20:25:23] [INFO ] Invariant cache hit.
[2023-03-14 20:25:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:30] [INFO ] Implicit Places using invariants and state equation in 7130 ms returned []
Implicit Place search using SMT with State Equation took 7500 ms to find 0 implicit places.
[2023-03-14 20:25:30] [INFO ] Invariant cache hit.
[2023-03-14 20:25:31] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8784 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 950 ms :[p1, true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 1}, { cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s77 1) (GEQ s97 1)), p0:(AND (GEQ s12 1) (GEQ s57 1) (GEQ s68 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, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-11 finished in 9768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:32] [INFO ] Invariant cache hit.
[2023-03-14 20:25:32] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-14 20:25:33] [INFO ] Invariant cache hit.
[2023-03-14 20:25:33] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-14 20:25:33] [INFO ] Invariant cache hit.
[2023-03-14 20:25:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:40] [INFO ] Implicit Places using invariants and state equation in 7161 ms returned []
Implicit Place search using SMT with State Equation took 7526 ms to find 0 implicit places.
[2023-03-14 20:25:40] [INFO ] Invariant cache hit.
[2023-03-14 20:25:41] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8773 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1683 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s28 1) (GEQ s39 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-12 finished in 10477 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 8 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:42] [INFO ] Invariant cache hit.
[2023-03-14 20:25:43] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
[2023-03-14 20:25:43] [INFO ] Invariant cache hit.
[2023-03-14 20:25:43] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-14 20:25:43] [INFO ] Invariant cache hit.
[2023-03-14 20:25:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:50] [INFO ] Implicit Places using invariants and state equation in 6980 ms returned []
Implicit Place search using SMT with State Equation took 7310 ms to find 0 implicit places.
[2023-03-14 20:25:50] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:25:50] [INFO ] Invariant cache hit.
[2023-03-14 20:25:51] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8673 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-13 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 s13 1) (GEQ s18 1) (GEQ s63 1) (GEQ s108 1)), p1:(AND (GEQ s3 1) (GEQ s125 1) (GEQ s130 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-13 finished in 8815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0)))&&(G(p1)||X(G(p2)))) U p0))'
Support contains 9 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:51] [INFO ] Invariant cache hit.
[2023-03-14 20:25:52] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2023-03-14 20:25:52] [INFO ] Invariant cache hit.
[2023-03-14 20:25:52] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-14 20:25:52] [INFO ] Invariant cache hit.
[2023-03-14 20:25:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:59] [INFO ] Implicit Places using invariants and state equation in 6999 ms returned []
Implicit Place search using SMT with State Equation took 7337 ms to find 0 implicit places.
[2023-03-14 20:25:59] [INFO ] Invariant cache hit.
[2023-03-14 20:26:00] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8500 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s46 1), p1:(AND (GEQ s26 1) (GEQ s99 1) (GEQ s128 1)), p2:(OR (GEQ s22 1) (AND (GEQ s31 1) (GEQ s80 1) (GEQ s108 1) (GEQ s153 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-15 finished in 8812 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)))'
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))))))'
[2023-03-14 20:26:00] [INFO ] Flatten gal took : 141 ms
[2023-03-14 20:26:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 11 ms.
[2023-03-14 20:26:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 11 ms.
Total runtime 198547 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA PhilosophersDyn-PT-10-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678825705254

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-PT-10-LTLFireability-01
lola: time limit : 1795 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1795 1/32 PhilosophersDyn-PT-10-LTLFireability-01 23197 m, 4639 m/sec, 61522 t fired, .

Time elapsed: 15 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1795 1/32 PhilosophersDyn-PT-10-LTLFireability-01 47850 m, 4930 m/sec, 129409 t fired, .

Time elapsed: 20 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1795 1/32 PhilosophersDyn-PT-10-LTLFireability-01 72083 m, 4846 m/sec, 198148 t fired, .

Time elapsed: 25 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1795 1/32 PhilosophersDyn-PT-10-LTLFireability-01 96310 m, 4845 m/sec, 268132 t fired, .

Time elapsed: 30 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1795 1/32 PhilosophersDyn-PT-10-LTLFireability-01 120683 m, 4874 m/sec, 339411 t fired, .

Time elapsed: 35 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1795 2/32 PhilosophersDyn-PT-10-LTLFireability-01 145312 m, 4925 m/sec, 412340 t fired, .

Time elapsed: 40 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1795 2/32 PhilosophersDyn-PT-10-LTLFireability-01 168256 m, 4588 m/sec, 478088 t fired, .

Time elapsed: 45 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1795 2/32 PhilosophersDyn-PT-10-LTLFireability-01 192189 m, 4786 m/sec, 549574 t fired, .

Time elapsed: 50 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-PT-10-LTLFireability-01
lola: result : true
lola: markings : 197508
lola: fired transitions : 565066
lola: time used : 41.000000
lola: memory pages used : 2
lola: LAUNCH task # 4 (type EXCL) for 3 PhilosophersDyn-PT-10-LTLFireability-06
lola: time limit : 3549 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/3549 1/32 PhilosophersDyn-PT-10-LTLFireability-06 22351 m, 4470 m/sec, 65267 t fired, .

Time elapsed: 55 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/3549 1/32 PhilosophersDyn-PT-10-LTLFireability-06 50757 m, 5681 m/sec, 152279 t fired, .

Time elapsed: 60 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/3549 1/32 PhilosophersDyn-PT-10-LTLFireability-06 78593 m, 5567 m/sec, 239498 t fired, .

Time elapsed: 65 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/3549 1/32 PhilosophersDyn-PT-10-LTLFireability-06 106242 m, 5529 m/sec, 326688 t fired, .

Time elapsed: 70 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/3549 1/32 PhilosophersDyn-PT-10-LTLFireability-06 132639 m, 5279 m/sec, 411334 t fired, .

Time elapsed: 75 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/3549 2/32 PhilosophersDyn-PT-10-LTLFireability-06 159146 m, 5301 m/sec, 497185 t fired, .

Time elapsed: 80 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/3549 2/32 PhilosophersDyn-PT-10-LTLFireability-06 185844 m, 5339 m/sec, 583999 t fired, .

Time elapsed: 85 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/3549 2/32 PhilosophersDyn-PT-10-LTLFireability-06 212479 m, 5327 m/sec, 669915 t fired, .

Time elapsed: 90 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/3549 2/32 PhilosophersDyn-PT-10-LTLFireability-06 239020 m, 5308 m/sec, 756522 t fired, .

Time elapsed: 95 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/3549 2/32 PhilosophersDyn-PT-10-LTLFireability-06 265645 m, 5325 m/sec, 843213 t fired, .

Time elapsed: 100 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/3549 3/32 PhilosophersDyn-PT-10-LTLFireability-06 292469 m, 5364 m/sec, 931056 t fired, .

Time elapsed: 105 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/3549 3/32 PhilosophersDyn-PT-10-LTLFireability-06 318679 m, 5242 m/sec, 1016092 t fired, .

Time elapsed: 110 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/3549 3/32 PhilosophersDyn-PT-10-LTLFireability-06 345361 m, 5336 m/sec, 1103446 t fired, .

Time elapsed: 115 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/3549 3/32 PhilosophersDyn-PT-10-LTLFireability-06 371530 m, 5233 m/sec, 1188265 t fired, .

Time elapsed: 120 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/3549 3/32 PhilosophersDyn-PT-10-LTLFireability-06 397532 m, 5200 m/sec, 1273365 t fired, .

Time elapsed: 125 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 4 (type EXCL) for PhilosophersDyn-PT-10-LTLFireability-06
lola: result : true
lola: markings : 400181
lola: fired transitions : 1282540
lola: time used : 75.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLFireability-01: LTL true LTL model checker
PhilosophersDyn-PT-10-LTLFireability-06: LTL true LTL model checker


Time elapsed: 126 secs. Pages in use: 3

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

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