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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Anderson-PT-06-LTLFireability-00
FORMULA_NAME Anderson-PT-06-LTLFireability-01
FORMULA_NAME Anderson-PT-06-LTLFireability-02
FORMULA_NAME Anderson-PT-06-LTLFireability-03
FORMULA_NAME Anderson-PT-06-LTLFireability-04
FORMULA_NAME Anderson-PT-06-LTLFireability-05
FORMULA_NAME Anderson-PT-06-LTLFireability-06
FORMULA_NAME Anderson-PT-06-LTLFireability-07
FORMULA_NAME Anderson-PT-06-LTLFireability-08
FORMULA_NAME Anderson-PT-06-LTLFireability-09
FORMULA_NAME Anderson-PT-06-LTLFireability-10
FORMULA_NAME Anderson-PT-06-LTLFireability-11
FORMULA_NAME Anderson-PT-06-LTLFireability-12
FORMULA_NAME Anderson-PT-06-LTLFireability-13
FORMULA_NAME Anderson-PT-06-LTLFireability-14
FORMULA_NAME Anderson-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680827313994

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=Anderson-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:28:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 00:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:28:35] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-04-07 00:28:35] [INFO ] Transformed 229 places.
[2023-04-07 00:28:35] [INFO ] Transformed 600 transitions.
[2023-04-07 00:28:35] [INFO ] Found NUPN structural information;
[2023-04-07 00:28:35] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 188 transition count 419
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 188 transition count 419
Applied a total of 82 rules in 36 ms. Remains 188 /229 variables (removed 41) and now considering 419/600 (removed 181) transitions.
// Phase 1: matrix 419 rows 188 cols
[2023-04-07 00:28:36] [INFO ] Computed 15 invariants in 25 ms
[2023-04-07 00:28:36] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-04-07 00:28:36] [INFO ] Invariant cache hit.
[2023-04-07 00:28:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 00:28:36] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-04-07 00:28:36] [INFO ] Invariant cache hit.
[2023-04-07 00:28:37] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/229 places, 419/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1078 ms. Remains : 188/229 places, 419/600 transitions.
Support contains 37 out of 188 places after structural reductions.
[2023-04-07 00:28:37] [INFO ] Flatten gal took : 59 ms
[2023-04-07 00:28:37] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:28:37] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 36 out of 188 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 29) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:28:38] [INFO ] Invariant cache hit.
[2023-04-07 00:28:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 00:28:38] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 13 ms returned sat
[2023-04-07 00:28:38] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:28:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 00:28:38] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 00:28:38] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:28:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 00:28:38] [INFO ] After 94ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:28:38] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-04-07 00:28:39] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 77 place count 141 transition count 232
Iterating global reduction 0 with 17 rules applied. Total rules applied 94 place count 141 transition count 232
Applied a total of 94 rules in 33 ms. Remains 141 /188 variables (removed 47) and now considering 232/419 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 141/188 places, 232/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 37687 steps, run visited all 3 properties in 203 ms. (steps per millisecond=185 )
Probabilistic random walk after 37687 steps, saw 22687 distinct states, run finished after 203 ms. (steps per millisecond=185 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 7 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 00:28:40] [INFO ] Computed 15 invariants in 8 ms
[2023-04-07 00:28:40] [INFO ] Implicit Places using invariants in 151 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 169/188 places, 251/419 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 433 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s30 1)), p1:(AND (EQ s9 1) (EQ s22 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 228 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-00 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 140 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 140 transition count 221
Applied a total of 96 rules in 22 ms. Remains 140 /188 variables (removed 48) and now considering 221/419 (removed 198) transitions.
// Phase 1: matrix 221 rows 140 cols
[2023-04-07 00:28:40] [INFO ] Computed 15 invariants in 7 ms
[2023-04-07 00:28:41] [INFO ] Implicit Places using invariants in 125 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/188 places, 221/419 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 139 transition count 186
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 104 transition count 186
Applied a total of 70 rules in 9 ms. Remains 104 /139 variables (removed 35) and now considering 186/221 (removed 35) transitions.
// Phase 1: matrix 186 rows 104 cols
[2023-04-07 00:28:41] [INFO ] Computed 14 invariants in 7 ms
[2023-04-07 00:28:41] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 00:28:41] [INFO ] Invariant cache hit.
[2023-04-07 00:28:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 00:28:41] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/188 places, 186/419 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 104/188 places, 186/419 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-01 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 (EQ s13 1) (EQ s19 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 0 reset in 141 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-01 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(!(p0 U (X(p0) U !p1)))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 9 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 00:28:41] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:41] [INFO ] Implicit Places using invariants in 121 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 169/188 places, 251/419 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s23 1)), p1:(AND (EQ s0 1) (EQ s72 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 97 reset in 158 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-02 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||F(p2)))||X((p3||G(F(p4))))))'
Support contains 10 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 173 transition count 284
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 173 transition count 284
Applied a total of 30 rules in 6 ms. Remains 173 /188 variables (removed 15) and now considering 284/419 (removed 135) transitions.
// Phase 1: matrix 284 rows 173 cols
[2023-04-07 00:28:41] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:42] [INFO ] Implicit Places using invariants in 120 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/188 places, 284/419 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 172/188 places, 284/419 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3) (NOT p4)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p4)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s26 1)), p2:(AND (EQ s9 1) (EQ s20 1)), p0:(AND (EQ s15 1) (EQ s51 1)), p3:(AND (EQ s12 1) (EQ s27 1)), p4:(AND (EQ s6 1) (EQ s19 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 133 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-03 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G((p0||(p0 U p2)))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 172 transition count 273
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 172 transition count 273
Applied a total of 32 rules in 9 ms. Remains 172 /188 variables (removed 16) and now considering 273/419 (removed 146) transitions.
// Phase 1: matrix 273 rows 172 cols
[2023-04-07 00:28:42] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:42] [INFO ] Implicit Places using invariants in 390 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/188 places, 273/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 402 ms. Remains : 171/188 places, 273/419 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s15 1) (EQ s24 1)), p1:(AND (EQ s7 1) (EQ s20 1)), p2:(AND (EQ s9 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-04 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&((!p0 U (G(!p0)||(!p0&&G(!p3))))||p2))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 262
Applied a total of 34 rules in 7 ms. Remains 171 /188 variables (removed 17) and now considering 262/419 (removed 157) transitions.
// Phase 1: matrix 262 rows 171 cols
[2023-04-07 00:28:43] [INFO ] Computed 15 invariants in 5 ms
[2023-04-07 00:28:43] [INFO ] Implicit Places using invariants in 129 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 262/419 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 170/188 places, 262/419 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), p0, p3, (AND p0 p3)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p3), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s13 1) (EQ s21 1)), p0:(AND (EQ s14 1) (EQ s19 1)), p2:(OR (EQ s13 0) (EQ s21 0)), p3:(AND (EQ s0 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-05 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 77 place count 141 transition count 232
Iterating global reduction 0 with 17 rules applied. Total rules applied 94 place count 141 transition count 232
Applied a total of 94 rules in 18 ms. Remains 141 /188 variables (removed 47) and now considering 232/419 (removed 187) transitions.
// Phase 1: matrix 232 rows 141 cols
[2023-04-07 00:28:43] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 00:28:43] [INFO ] Implicit Places using invariants in 128 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/188 places, 232/419 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 140 transition count 198
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 106 transition count 198
Applied a total of 68 rules in 7 ms. Remains 106 /140 variables (removed 34) and now considering 198/232 (removed 34) transitions.
// Phase 1: matrix 198 rows 106 cols
[2023-04-07 00:28:43] [INFO ] Computed 14 invariants in 11 ms
[2023-04-07 00:28:44] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-04-07 00:28:44] [INFO ] Invariant cache hit.
[2023-04-07 00:28:44] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 00:28:44] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/188 places, 198/419 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 106/188 places, 198/419 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s22 1)), p0:(AND (EQ s9 1) (EQ s24 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 16 reset in 129 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-06 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&X(p1)))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 172 transition count 263
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 172 transition count 263
Applied a total of 32 rules in 4 ms. Remains 172 /188 variables (removed 16) and now considering 263/419 (removed 156) transitions.
// Phase 1: matrix 263 rows 172 cols
[2023-04-07 00:28:44] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:44] [INFO ] Implicit Places using invariants in 120 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/188 places, 263/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 171/188 places, 263/419 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Anderson-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s15 1) (EQ s24 1)) (AND (EQ s15 1) (EQ s21 1))), p1:(EQ s56 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-07 finished in 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((X(G(p2))&&p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 252
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 252
Applied a total of 34 rules in 7 ms. Remains 171 /188 variables (removed 17) and now considering 252/419 (removed 167) transitions.
// Phase 1: matrix 252 rows 171 cols
[2023-04-07 00:28:44] [INFO ] Computed 15 invariants in 6 ms
[2023-04-07 00:28:44] [INFO ] Implicit Places using invariants in 120 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 252/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 170/188 places, 252/419 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s22 1)), p1:(AND (EQ s15 1) (EQ s22 1)), p2:(EQ s43 0)], 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 0 reset in 107 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-10 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X((p1||X(!p1))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 262
Applied a total of 34 rules in 5 ms. Remains 171 /188 variables (removed 17) and now considering 262/419 (removed 157) transitions.
// Phase 1: matrix 262 rows 171 cols
[2023-04-07 00:28:45] [INFO ] Computed 15 invariants in 2 ms
[2023-04-07 00:28:45] [INFO ] Implicit Places using invariants in 128 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/188 places, 262/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 170/188 places, 262/419 transitions.
Stuttering acceptance computed with spot in 238 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s19 1)), p1:(AND (EQ s9 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24943 reset in 186 ms.
Product exploration explored 100000 steps with 24934 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 170 cols
[2023-04-07 00:28:46] [INFO ] Computed 14 invariants in 7 ms
[2023-04-07 00:28:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-04-07 00:28:46] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-07 00:28:46] [INFO ] After 47ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-11 finished in 1560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 188 transition count 389
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 158 transition count 389
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 140 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 140 transition count 221
Applied a total of 96 rules in 17 ms. Remains 140 /188 variables (removed 48) and now considering 221/419 (removed 198) transitions.
// Phase 1: matrix 221 rows 140 cols
[2023-04-07 00:28:46] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-07 00:28:46] [INFO ] Invariant cache hit.
[2023-04-07 00:28:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 00:28:47] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-04-07 00:28:47] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 00:28:47] [INFO ] Invariant cache hit.
[2023-04-07 00:28:47] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/188 places, 221/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 556 ms. Remains : 140/188 places, 221/419 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s21 1)) (AND (EQ s0 1) (EQ s121 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]]
Product exploration explored 100000 steps with 93 reset in 129 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 5 ms.
FORMULA Anderson-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-14 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(!p0))||(!p1&&F(!p0)))) U p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 419/419 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 170 transition count 251
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 170 transition count 251
Applied a total of 36 rules in 7 ms. Remains 170 /188 variables (removed 18) and now considering 251/419 (removed 168) transitions.
// Phase 1: matrix 251 rows 170 cols
[2023-04-07 00:28:47] [INFO ] Computed 15 invariants in 3 ms
[2023-04-07 00:28:47] [INFO ] Implicit Places using invariants in 119 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/188 places, 251/419 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 169/188 places, 251/419 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : Anderson-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s125 1)), p0:(AND (EQ s10 1) (EQ s23 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 114 reset in 202 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-15 finished in 476 ms.
All properties solved by simple procedures.
Total runtime 12556 ms.
ITS solved all properties within timeout

BK_STOP 1680827329083

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="Anderson-PT-06"
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 Anderson-PT-06, 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 r519-tall-167987244700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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