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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 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 103K 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-04-LTLFireability-00
FORMULA_NAME Anderson-PT-04-LTLFireability-01
FORMULA_NAME Anderson-PT-04-LTLFireability-02
FORMULA_NAME Anderson-PT-04-LTLFireability-03
FORMULA_NAME Anderson-PT-04-LTLFireability-04
FORMULA_NAME Anderson-PT-04-LTLFireability-05
FORMULA_NAME Anderson-PT-04-LTLFireability-06
FORMULA_NAME Anderson-PT-04-LTLFireability-07
FORMULA_NAME Anderson-PT-04-LTLFireability-08
FORMULA_NAME Anderson-PT-04-LTLFireability-09
FORMULA_NAME Anderson-PT-04-LTLFireability-10
FORMULA_NAME Anderson-PT-04-LTLFireability-11
FORMULA_NAME Anderson-PT-04-LTLFireability-12
FORMULA_NAME Anderson-PT-04-LTLFireability-13
FORMULA_NAME Anderson-PT-04-LTLFireability-14
FORMULA_NAME Anderson-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680827113684

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-04
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:25:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 00:25:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:25:15] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-04-07 00:25:15] [INFO ] Transformed 105 places.
[2023-04-07 00:25:15] [INFO ] Transformed 200 transitions.
[2023-04-07 00:25:15] [INFO ] Found NUPN structural information;
[2023-04-07 00:25:15] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 186
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 186
Applied a total of 16 rules in 16 ms. Remains 97 /105 variables (removed 8) and now considering 186/200 (removed 14) transitions.
// Phase 1: matrix 186 rows 97 cols
[2023-04-07 00:25:15] [INFO ] Computed 11 invariants in 20 ms
[2023-04-07 00:25:15] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-04-07 00:25:15] [INFO ] Invariant cache hit.
[2023-04-07 00:25:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:15] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-04-07 00:25:15] [INFO ] Invariant cache hit.
[2023-04-07 00:25:15] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 186/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 97/105 places, 186/200 transitions.
Support contains 39 out of 97 places after structural reductions.
[2023-04-07 00:25:16] [INFO ] Flatten gal took : 36 ms
[2023-04-07 00:25:16] [INFO ] Flatten gal took : 15 ms
[2023-04-07 00:25:16] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 38 out of 97 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 34) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:25:16] [INFO ] Invariant cache hit.
[2023-04-07 00:25:16] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:25:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-04-07 00:25:16] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 00:25:16] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA Anderson-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G((!p0 U (X(p0)&&p1)))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 85 transition count 174
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 70 transition count 99
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 70 transition count 99
Applied a total of 54 rules in 19 ms. Remains 70 /97 variables (removed 27) and now considering 99/186 (removed 87) transitions.
// Phase 1: matrix 99 rows 70 cols
[2023-04-07 00:25:17] [INFO ] Computed 11 invariants in 5 ms
[2023-04-07 00:25:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-07 00:25:17] [INFO ] Invariant cache hit.
[2023-04-07 00:25:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:17] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-04-07 00:25:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 00:25:17] [INFO ] Invariant cache hit.
[2023-04-07 00:25:17] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/97 places, 99/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 70/97 places, 99/186 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 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s54 1)), p0:(AND (EQ s10 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-00 finished in 828 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(p0)||X(X(X(F(p1)))))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 111
Applied a total of 30 rules in 10 ms. Remains 82 /97 variables (removed 15) and now considering 111/186 (removed 75) transitions.
// Phase 1: matrix 111 rows 82 cols
[2023-04-07 00:25:18] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:18] [INFO ] Implicit Places using invariants in 90 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 111/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 81/97 places, 111/186 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(OR (EQ s5 0) (EQ s12 0)), p0:(OR (NEQ s1 1) (NEQ s51 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]]
Product exploration explored 100000 steps with 19947 reset in 155 ms.
Product exploration explored 100000 steps with 19943 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 00:25:19] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 00:25:19] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:25:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-04-07 00:25:19] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 00:25:19] [INFO ] After 26ms SMT Verify possible using all constraints in natural 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 p1 p0), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-04-07 00:25:19] [INFO ] Invariant cache hit.
[2023-04-07 00:25:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 00:25:19] [INFO ] Invariant cache hit.
[2023-04-07 00:25:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-04-07 00:25:19] [INFO ] Invariant cache hit.
[2023-04-07 00:25:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 81/81 places, 111/111 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 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 277 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 81 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 11 place count 81 transition count 111
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 23 place count 81 transition count 111
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 23 rules in 18 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-04-07 00:25:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 00:25:21] [INFO ] Computed 10 invariants in 2 ms
[2023-04-07 00:25:21] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 111/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 81/81 places, 111/111 transitions.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 00:25:21] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 00:25:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 00:25:21] [INFO ] Invariant cache hit.
[2023-04-07 00:25:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:21] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-04-07 00:25:21] [INFO ] Invariant cache hit.
[2023-04-07 00:25:21] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 81/81 places, 111/111 transitions.
Treatment of property Anderson-PT-04-LTLFireability-01 finished in 3608 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)||G(p1)) U p2))'
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 9 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 00:25:21] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 00:25:21] [INFO ] Implicit Places using invariants in 51 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s29 1)), p1:(AND (EQ s5 1) (EQ s14 1)), p0:(AND (EQ s6 1) (EQ s16 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-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-02 finished in 249 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(X(G(p0)))&&F(p1)))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 8 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 00:25:21] [INFO ] Computed 11 invariants in 3 ms
[2023-04-07 00:25:21] [INFO ] Implicit Places using invariants in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Anderson-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s15 1)), p0:(AND (EQ s10 1) (EQ s17 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 4 steps with 1 reset in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-03 finished in 236 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 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 85 transition count 174
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 69 transition count 92
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 69 transition count 92
Applied a total of 56 rules in 15 ms. Remains 69 /97 variables (removed 28) and now considering 92/186 (removed 94) transitions.
// Phase 1: matrix 92 rows 69 cols
[2023-04-07 00:25:22] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 00:25:22] [INFO ] Invariant cache hit.
[2023-04-07 00:25:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-04-07 00:25:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 00:25:22] [INFO ] Invariant cache hit.
[2023-04-07 00:25:22] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/97 places, 92/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 69/97 places, 92/186 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s68 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 300 reset in 83 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-05 finished in 442 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)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 97 transition count 175
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 86 transition count 175
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 37 place count 71 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 52 place count 71 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 70 transition count 93
Applied a total of 54 rules in 13 ms. Remains 70 /97 variables (removed 27) and now considering 93/186 (removed 93) transitions.
// Phase 1: matrix 93 rows 70 cols
[2023-04-07 00:25:22] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants in 54 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/97 places, 93/186 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 69 transition count 77
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 53 transition count 77
Applied a total of 32 rules in 4 ms. Remains 53 /69 variables (removed 16) and now considering 77/93 (removed 16) transitions.
// Phase 1: matrix 77 rows 53 cols
[2023-04-07 00:25:22] [INFO ] Computed 10 invariants in 0 ms
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 00:25:22] [INFO ] Invariant cache hit.
[2023-04-07 00:25:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/97 places, 77/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 53/97 places, 77/186 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 835 reset in 85 ms.
Stack based approach found an accepted trace after 67 steps with 5 reset with depth 27 and stack size 27 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-06 finished in 368 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((F((X((!p2 U (!p3||G(!p2))))&&p1))&&p0))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 112
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 112
Applied a total of 28 rules in 4 ms. Remains 83 /97 variables (removed 14) and now considering 112/186 (removed 74) transitions.
// Phase 1: matrix 112 rows 83 cols
[2023-04-07 00:25:22] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 00:25:22] [INFO ] Implicit Places using invariants in 60 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 112/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 82/97 places, 112/186 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (AND p2 p3)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p3 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p3 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s24 1)), p1:(AND (OR (NEQ s5 1) (NEQ s15 1)) (NEQ s25 1)), p3:(AND (EQ s5 1) (EQ s15 1)), p2:(OR (AND (EQ s5 1) (EQ s15 1)) (EQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 87 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-07 finished in 355 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&&(F(!p1) U G((F(p0)&&p2))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 97 transition count 175
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 86 transition count 175
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 36 place count 72 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 50 place count 72 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 71 transition count 100
Applied a total of 52 rules in 21 ms. Remains 71 /97 variables (removed 26) and now considering 100/186 (removed 86) transitions.
// Phase 1: matrix 100 rows 71 cols
[2023-04-07 00:25:23] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 00:25:23] [INFO ] Implicit Places using invariants in 54 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/97 places, 100/186 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 92
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 62 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 59 transition count 89
Applied a total of 22 rules in 5 ms. Remains 59 /70 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 59 cols
[2023-04-07 00:25:23] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 00:25:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 00:25:23] [INFO ] Invariant cache hit.
[2023-04-07 00:25:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/97 places, 89/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 59/97 places, 89/186 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s22 1), p2:(AND (EQ s6 1) (EQ s16 1)), p1:(AND (EQ s0 1) (EQ s41 1))], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 298 reset in 98 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-08 finished in 583 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(X(F((p0||(p1 U p2)||(F(p4)&&p3))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 84 transition count 119
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 84 transition count 119
Applied a total of 26 rules in 13 ms. Remains 84 /97 variables (removed 13) and now considering 119/186 (removed 67) transitions.
// Phase 1: matrix 119 rows 84 cols
[2023-04-07 00:25:23] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:23] [INFO ] Implicit Places using invariants in 65 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/97 places, 119/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 83/97 places, 119/186 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(EQ s26 1), p2:(AND (EQ s9 1) (EQ s14 1)), p3:(AND (EQ s9 1) (EQ s14 1)), p4:(AND (EQ s8 1) (EQ s16 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 12 reset in 104 ms.
Stack based approach found an accepted trace after 39 steps with 1 reset with depth 25 and stack size 25 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-09 finished in 392 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))||(F(p0)&&(!p1||G(F(!p2))))))))'
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 3 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 00:25:24] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:24] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s16 1)), p1:(AND (EQ s3 1) (EQ s62 1)), p2:(AND (EQ s6 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 70 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-10 finished in 395 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(X((F(G(!p0)) U p1))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 104
Applied a total of 32 rules in 2 ms. Remains 81 /97 variables (removed 16) and now considering 104/186 (removed 82) transitions.
// Phase 1: matrix 104 rows 81 cols
[2023-04-07 00:25:24] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 00:25:24] [INFO ] Invariant cache hit.
[2023-04-07 00:25:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:24] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-04-07 00:25:24] [INFO ] Invariant cache hit.
[2023-04-07 00:25:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 104/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 81/97 places, 104/186 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : Anderson-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s43 1)), p0:(AND (EQ s0 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-11 finished in 467 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 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 85 transition count 174
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 70 transition count 99
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 70 transition count 99
Applied a total of 54 rules in 8 ms. Remains 70 /97 variables (removed 27) and now considering 99/186 (removed 87) transitions.
// Phase 1: matrix 99 rows 70 cols
[2023-04-07 00:25:25] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 00:25:25] [INFO ] Implicit Places using invariants in 54 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/97 places, 99/186 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 4 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2023-04-07 00:25:25] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 00:25:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 00:25:25] [INFO ] Invariant cache hit.
[2023-04-07 00:25:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 00:25:25] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/97 places, 84/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 54/97 places, 84/186 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-12 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 s9 1) (EQ s16 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 77 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-12 finished in 327 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(X((G(!p0)||X(p1)))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 104
Applied a total of 32 rules in 2 ms. Remains 81 /97 variables (removed 16) and now considering 104/186 (removed 82) transitions.
// Phase 1: matrix 104 rows 81 cols
[2023-04-07 00:25:25] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 00:25:25] [INFO ] Implicit Places using invariants in 48 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 104/186 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 80/97 places, 104/186 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(OR (EQ s3 0) (EQ s60 0)), p0:(OR (NEQ s1 1) (NEQ s50 1))], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 363 steps with 90 reset in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-13 finished in 276 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(p0)||X(X(X(F(p1)))))))'
[2023-04-07 00:25:25] [INFO ] Flatten gal took : 14 ms
[2023-04-07 00:25:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 00:25:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 186 transitions and 710 arcs took 2 ms.
Total runtime 10720 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Anderson-PT-04-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680827126873

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-04-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Anderson-PT-04-LTLFireability-01
lola: result : true
lola: markings : 211
lola: fired transitions : 296
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-04-LTLFireability-01: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

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