Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500596.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 124K Apr 29 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 29 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 29 19:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 526K Apr 29 19:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 74K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 87K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 228K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 57K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 534K May 10 09:33 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 BART-PT-002-LTLFireability-00
FORMULA_NAME BART-PT-002-LTLFireability-01
FORMULA_NAME BART-PT-002-LTLFireability-02
FORMULA_NAME BART-PT-002-LTLFireability-03
FORMULA_NAME BART-PT-002-LTLFireability-04
FORMULA_NAME BART-PT-002-LTLFireability-05
FORMULA_NAME BART-PT-002-LTLFireability-06
FORMULA_NAME BART-PT-002-LTLFireability-07
FORMULA_NAME BART-PT-002-LTLFireability-08
FORMULA_NAME BART-PT-002-LTLFireability-09
FORMULA_NAME BART-PT-002-LTLFireability-10
FORMULA_NAME BART-PT-002-LTLFireability-11
FORMULA_NAME BART-PT-002-LTLFireability-12
FORMULA_NAME BART-PT-002-LTLFireability-13
FORMULA_NAME BART-PT-002-LTLFireability-14
FORMULA_NAME BART-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667285447

Running Version 202205111006
[2022-05-16 02:14:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:14:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:14:46] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-16 02:14:46] [INFO ] Transformed 474 places.
[2022-05-16 02:14:46] [INFO ] Transformed 404 transitions.
[2022-05-16 02:14:46] [INFO ] Found NUPN structural information;
[2022-05-16 02:14:46] [INFO ] Parsed PT model containing 474 places and 404 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 20 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:47] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 49 ms
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:14:48] [INFO ] Input system was already deterministic with 404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 26) seen :25
Finished Best-First random walk after 747 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=373 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1))&&(F(p0)||F(p2))))'
Support contains 140 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 18 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 23 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:49] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/264 places, 398/404 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, p1, (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BART-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s3 1)), p2:(OR (EQ s86 1) (EQ s92 1) (EQ s236 1) (EQ s8 1) (EQ s166 1) (EQ s151 1) (EQ s85 1) (EQ s172 1) (EQ s77 1) (EQ s157 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-00 finished in 798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p0)||G(F((F(p2)&&p1))))))'
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:49] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-16 02:14:49] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-16 02:14:49] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s14 1) (EQ s58 1) (EQ s59 1) (EQ s24 1) (EQ s15 1) (EQ s51 1) (EQ s66 1) (EQ s50 1) (EQ s67 1) (EQ s75 1) (EQ s37 1) (EQ s10 1) (EQ s11 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11474 reset in 539 ms.
Stack based approach found an accepted trace after 39206 steps with 4521 reset with depth 11 and stack size 11 in 169 ms.
FORMULA BART-PT-002-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-01 finished in 1286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U !F(!(F(p1)&&p1)))))'
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:51] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1]
Running random walk in product with property : BART-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s14 1) (EQ s58 1) (EQ s59 1) (EQ s24 1) (EQ s15 1) (EQ s51 1) (EQ s66 1) (EQ s50 1) (EQ s67 1) (EQ s75 1) (EQ s37 1) (EQ s10 1) (EQ s11 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9384 reset in 397 ms.
Stack based approach found an accepted trace after 1075 steps with 110 reset with depth 20 and stack size 20 in 5 ms.
FORMULA BART-PT-002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-02 finished in 1063 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(((F(p1)||p0)&&(!X(p2) U p1))))&&X(p1)))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 246 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 246 transition count 386
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 234 transition count 374
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 228 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 228 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 222 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 222 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 216 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 216 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 210 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 206 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 202 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 200 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 200 transition count 340
Applied a total of 128 rules in 44 ms. Remains 200 /264 variables (removed 64) and now considering 340/404 (removed 64) transitions.
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-16 02:14:52] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/264 places, 340/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/264 places, 340/404 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) p2)]
Running random walk in product with property : BART-PT-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s145 1) (EQ s69 1) (EQ s90 1) (EQ s71 1) (EQ s143 1) (EQ s160 1) (EQ s92 1) (EQ s141 1) (EQ s189 1) (EQ s163 1) (EQ s26 1) (EQ s187 1) (EQ s135...], 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 11 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-03 finished in 578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(G(p0))) U F(G(!p0))) U G(p1)))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 264 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 22 rules applied. Total rules applied 26 place count 260 transition count 382
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 44 place count 242 transition count 382
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 44 place count 242 transition count 374
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 72 place count 222 transition count 362
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 222 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 222 transition count 360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 92 place count 216 transition count 354
Iterating global reduction 4 with 6 rules applied. Total rules applied 98 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 104 place count 210 transition count 348
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 210 transition count 348
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 116 place count 204 transition count 342
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 204 transition count 342
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 200 transition count 338
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 200 transition count 338
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 196 transition count 334
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 196 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 194 transition count 332
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 194 transition count 332
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 166 place count 182 transition count 320
Applied a total of 166 rules in 72 ms. Remains 182 /264 variables (removed 82) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 182 cols
[2022-05-16 02:14:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 320 rows 182 cols
[2022-05-16 02:14:52] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-16 02:14:52] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-05-16 02:14:52] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 320 rows 182 cols
[2022-05-16 02:14:52] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:52] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/264 places, 320/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 182/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), p0]
Running random walk in product with property : BART-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s129 1) (EQ s59 1) (EQ s78 1) (EQ s61 1) (EQ s127 1) (EQ s142 1) (EQ s80 1) (EQ s125 1) (EQ s171 1) (EQ s145 1) (EQ s18 1) (EQ s169 1) (EQ s119...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA BART-PT-002-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-04 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||F(X(X((F(p2)&&p1))))))'
Support contains 260 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:53] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:53] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:53] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:53] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:53] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-16 02:14:53] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BART-PT-002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s92 1) (EQ s98 1) (EQ s242 1) (EQ s8 1) (EQ s172 1) (EQ s157 1) (EQ s91 1) (EQ s178 1) (EQ s83 1) (EQ s163 1) (EQ s171 1) (EQ s84 1) (EQ s9 1) ...], 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 8473 reset in 842 ms.
Stack based approach found an accepted trace after 2517 steps with 212 reset with depth 20 and stack size 20 in 19 ms.
FORMULA BART-PT-002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-05 finished in 1567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||X((X((F(p2)&&p3))&&X(p2)))))'
Support contains 196 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:54] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:54] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:55] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 337 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2) p1) (AND p0 (NOT p3) p1)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}]], initial=5, aps=[p0:(OR (EQ s14 1) (EQ s58 1) (EQ s59 1) (EQ s24 1) (EQ s15 1) (EQ s51 1) (EQ s66 1) (EQ s50 1) (EQ s67 1) (EQ s75 1) (EQ s37 1) (EQ s10 1) (EQ s11 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-06 finished in 1064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (G(p0)||p1)) U p0)||X((G(p3)||p2))))'
Support contains 140 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 4 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:55] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:55] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:55] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:55] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/264 places, 398/404 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BART-PT-002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(OR (EQ s86 1) (EQ s92 1) (EQ s236 1) (EQ s8 1) (EQ s166 1) (EQ s151 1) (EQ s85 1) (EQ s172 1) (EQ s77 1) (EQ s157 1) (EQ s165 1) (EQ s78 1) (EQ s9 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 874 ms.
Product exploration explored 100000 steps with 50000 reset in 1257 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) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 13 factoid took 340 ms. Reduced automaton from 7 states, 17 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-PT-002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-002-LTLFireability-07 finished in 3349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 36 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s1 0), p1:(AND (EQ s1 0) (OR (EQ s25 0) (EQ s0 0)))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-08 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G(X(F(p0)))&&p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 396 edges and 264 vertex of which 259 / 264 are part of one of the 2 SCC in 3 ms
Free SCC test removed 257 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 9 place count 4 transition count 6
Applied a total of 9 rules in 7 ms. Remains 4 /264 variables (removed 260) and now considering 6/404 (removed 398) transitions.
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 02:14:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 6/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/264 places, 6/404 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-09 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((!(G(F(p0)) U p1)||p2))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 398 edges and 264 vertex of which 259 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 257 places
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 7
Applied a total of 6 rules in 3 ms. Remains 5 /264 variables (removed 259) and now considering 7/404 (removed 397) transitions.
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 02:14:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 02:14:59] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/264 places, 7/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/264 places, 7/404 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p2)), true, (AND p0 p1), p0]
Running random walk in product with property : BART-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=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=[p2:(EQ s0 0), p1:(AND (EQ s0 1) (EQ s1 1)), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-10 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 400 edges and 264 vertex of which 262 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 260 places
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 398 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 2 transition count 3
Applied a total of 5 rules in 3 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 02:14:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/264 places, 3/404 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-11 finished in 103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 402 edges and 264 vertex of which 132 / 264 are part of one of the 1 SCC in 1 ms
Free SCC test removed 131 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 129 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 137 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 194 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 198 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 202 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 206 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 214 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 218 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 222 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 226 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 230 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 234 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 238 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 242 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 246 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 250 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 254 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 258 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 262 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 266 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 270 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 274 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 278 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 282 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 286 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 290 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 294 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 298 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 302 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 306 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 310 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 314 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 318 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 322 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 327 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 329 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 329 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 331 place count 2 transition count 3
Applied a total of 331 rules in 29 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 02:14:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/264 places, 3/404 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-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:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-12 finished in 118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0) U (X(F(!p0))||F(p1))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 180 place count 147 transition count 287
Iterating global reduction 0 with 54 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 241 place count 140 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 273 place count 125 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 283 place count 120 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 293 place count 115 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 301 place count 112 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 304 place count 112 transition count 252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 307 place count 109 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 107 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 107 transition count 247
Applied a total of 314 rules in 20 ms. Remains 107 /264 variables (removed 157) and now considering 247/404 (removed 157) transitions.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:59] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:14:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:15:00] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:15:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:15:00] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/264 places, 247/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/264 places, 247/404 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s22 1) (EQ s0 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 39587 reset in 326 ms.
Product exploration explored 100000 steps with 39616 reset in 271 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 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 89 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 247/247 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:15:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:15:01] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:15:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:15:01] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:15:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:15:01] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 247/247 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 p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 39529 reset in 284 ms.
Product exploration explored 100000 steps with 39641 reset in 259 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 247/247 transitions.
Graph (trivial) has 205 edges and 107 vertex of which 49 / 107 are part of one of the 1 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 58 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 58 transition count 129
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 58 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 56 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 56 transition count 127
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 56 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 56 transition count 125
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 42 place count 42 transition count 111
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 42 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 42 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 42 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 41 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 41 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 41 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 41 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 40 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 40 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 40 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 40 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 39 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 39 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 39 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 39 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 75 place count 38 transition count 99
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 76 place count 38 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 77 place count 38 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 79 place count 38 transition count 97
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 80 place count 37 transition count 96
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 81 place count 37 transition count 96
Performed 27 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 7 with 27 rules applied. Total rules applied 108 place count 37 transition count 200
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 7 with 104 rules applied. Total rules applied 212 place count 37 transition count 96
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 238 place count 11 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 26 rules applied. Total rules applied 264 place count 11 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 266 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 267 place count 10 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 268 place count 10 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 268 rules in 39 ms. Remains 10 /107 variables (removed 97) and now considering 15/247 (removed 232) transitions.
[2022-05-16 02:15:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2022-05-16 02:15:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/107 places, 15/247 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/107 places, 15/247 transitions.
Stuttering criterion allowed to conclude after 466 steps with 186 reset in 5 ms.
FORMULA BART-PT-002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-13 finished in 3546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 402 edges and 264 vertex of which 132 / 264 are part of one of the 1 SCC in 1 ms
Free SCC test removed 131 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 129 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 137 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 194 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 198 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 202 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 206 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 214 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 218 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 222 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 226 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 230 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 234 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 238 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 242 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 246 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 250 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 254 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 258 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 262 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 266 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 270 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 274 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 278 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 282 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 286 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 290 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 294 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 298 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 302 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 306 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 310 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 314 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 318 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 322 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 327 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 329 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 329 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 331 place count 2 transition count 3
Applied a total of 331 rules in 22 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:15:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:03] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:15:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:15:03] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-16 02:15:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:15:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:15:03] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/264 places, 3/404 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-14 finished in 109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X((G(p0)&&p1))) U (X(p0)&&F(p0)&&p0))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 178 place count 149 transition count 289
Iterating global reduction 0 with 52 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 238 place count 141 transition count 281
Iterating global reduction 0 with 8 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 309 place count 109 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 310 place count 109 transition count 249
Applied a total of 310 rules in 24 ms. Remains 109 /264 variables (removed 155) and now considering 249/404 (removed 155) transitions.
// Phase 1: matrix 249 rows 109 cols
[2022-05-16 02:15:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:15:03] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 249 rows 109 cols
[2022-05-16 02:15:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:15:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 109 cols
[2022-05-16 02:15:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:15:03] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/264 places, 249/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/264 places, 249/404 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s56 1), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-15 finished in 365 ms.
All properties solved by simple procedures.
Total runtime 17330 ms.

BK_STOP 1652667304054

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BART-PT-002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-002, 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 r006-tajo-165245689500596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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