fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r276-smll-165307353100244
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T4N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.535 18242.00 33052.00 214.20 TFFFFFFTFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353100244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-PT-Z4T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353100244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 19K Apr 29 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 29 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 29 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 65K May 10 09:34 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 UtilityControlRoom-PT-Z4T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653162724821

Running Version 202205111006
[2022-05-21 19:52:07] [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-21 19:52:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 19:52:07] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-05-21 19:52:07] [INFO ] Transformed 80 places.
[2022-05-21 19:52:07] [INFO ] Transformed 150 transitions.
[2022-05-21 19:52:07] [INFO ] Parsed PT model containing 80 places and 150 transitions in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2022-05-21 19:52:07] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 22 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2022-05-21 19:52:08] [INFO ] Computed 7 place invariants in 25 ms
[2022-05-21 19:52:08] [INFO ] Implicit Places using invariants in 326 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 399 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 79/80 places, 118/118 transitions.
Support contains 66 out of 79 places after structural reductions.
[2022-05-21 19:52:08] [INFO ] Flatten gal took : 82 ms
[2022-05-21 19:52:09] [INFO ] Flatten gal took : 24 ms
[2022-05-21 19:52:09] [INFO ] Input system was already deterministic with 118 transitions.
Finished random walk after 318 steps, including 0 resets, run visited all 29 properties in 96 ms. (steps per millisecond=3 )
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' '!(X(!(X(p0) U G((p0 U (!F(p1) U p1))))))'
Support contains 15 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 13 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:09] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-21 19:52:09] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:09] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-21 19:52:10] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:10] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-21 19:52:10] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 518 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s41 1)), p1:(OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ...], 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 33333 reset in 684 ms.
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-00 finished in 2273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(G(p0)))&&p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:12] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:12] [INFO ] Implicit Places using invariants in 102 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1)), p0:(OR (GEQ s43 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-01 finished in 416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 44 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 38 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 38 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 31 transition count 42
Applied a total of 103 rules in 19 ms. Remains 31 /79 variables (removed 48) and now considering 42/118 (removed 76) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-21 19:52:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 19:52:12] [INFO ] Implicit Places using invariants in 50 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/79 places, 42/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 30 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 22 transition count 34
Applied a total of 16 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 22 cols
[2022-05-21 19:52:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 19:52:12] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 34 rows 22 cols
[2022-05-21 19:52:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 19:52:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/79 places, 34/118 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/79 places, 34/118 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s16 1) (LT s19 1)) (OR (LT s17 1) (LT s19 1)) (OR (LT s13 1) (LT s18 1)) (OR (LT s10 1) (LT s18 1)) (OR (LT s15 1) (LT s19 1)) (OR (LT s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 346 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-02 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 12 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 7 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:13] [INFO ] Implicit Places using invariants in 92 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s43 1) (LT s42 1) (OR (LT s31 1) (LT s44 1)) (OR (LT s36 1) (LT s45 1)) (OR (LT s30 1) (LT s44 1)) (OR (LT s32 1) (LT s44 1)) (OR (LT s37 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-03 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)&&p0))||G(p2))))'
Support contains 25 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:13] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:13] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(AND (OR (AND (GEQ s3 1) (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s40 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s40 1)) (AND (GEQ s3 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1209 reset in 354 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-04 finished in 908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 34 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 79 cols
[2022-05-21 19:52:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:14] [INFO ] Implicit Places using invariants in 117 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/79 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/79 places, 118/118 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s67 1) (GEQ s66 1)), p0:(OR (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s...], 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 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-05 finished in 295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(F(p0)))))))'
Support contains 13 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
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 2 with 4 rules applied. Total rules applied 92 place count 37 transition count 68
Applied a total of 92 rules in 16 ms. Remains 37 /79 variables (removed 42) and now considering 68/118 (removed 50) transitions.
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:14] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:14] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-21 19:52:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:14] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/79 places, 68/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/79 places, 68/118 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s11 1) (LT s22 1)) (OR (LT s2 1) (LT s10 1) (LT s22 1)) (OR (LT s1 1) (LT s9 1) (LT s22 1)) (OR (LT s3 1) (LT s7 1) (LT s22 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12433 reset in 349 ms.
Product exploration explored 100000 steps with 12726 reset in 475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:16] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:16] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-21 19:52:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 68 rows 37 cols
[2022-05-21 19:52:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:16] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12493 reset in 347 ms.
Stack based approach found an accepted trace after 7192 steps with 898 reset with depth 7 and stack size 7 in 38 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-06 finished in 2917 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(F(X(p1))&&G(X(p1)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 5 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:17] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:17] [INFO ] Implicit Places using invariants in 87 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s39 1) (GEQ s38 1)), p1:(OR (GEQ s41 1) (GEQ s40 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 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-07 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)&&G(p1)))||(X(F(p1))&&p1))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 3 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:18] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 19:52:18] [INFO ] Implicit Places using invariants in 106 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(GEQ s43 1), p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 1 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-08 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U G((G(p1) U !p2)))&&F(p3)))||G(p1)))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 72 place count 47 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 41 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 39 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 39 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 35 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 35 transition count 52
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 32 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 32 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 29 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 29 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 29 transition count 37
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 3 with 4 rules applied. Total rules applied 115 place count 27 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 26 transition count 34
Applied a total of 117 rules in 20 ms. Remains 26 /79 variables (removed 53) and now considering 34/118 (removed 84) transitions.
// Phase 1: matrix 34 rows 26 cols
[2022-05-21 19:52:18] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 19:52:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 34 rows 26 cols
[2022-05-21 19:52:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:18] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-21 19:52:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 26 cols
[2022-05-21 19:52:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:18] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/79 places, 34/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/79 places, 34/118 transitions.
Stuttering acceptance computed with spot in 960 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (NOT p3) p2), p2, (NOT p3), p2, (AND (NOT p1) p2), (AND (NOT p3) (NOT p1)), (AND (NOT p1) p2), p2, p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1) p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p1 p0 (NOT p3))), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 7}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 7}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=1 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=1 dest: 9}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2 p0), acceptance={1} source=2 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=2 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=2 dest: 9}, { cond=(OR (AND p1 p0 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={} source=2 dest: 10}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=2 dest: 11}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=4 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=4 dest: 9}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 7}, { cond=(AND p1 p2 p0), acceptance={1} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=7 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2 p0), acceptance={1} source=7 dest: 7}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=8 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={1} source=8 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=8 dest: 9}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={1} source=9 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p1 p2 p0), acceptance={1} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=10 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={0, 1} source=11 dest: 11}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=12 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s22 1)), p2:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s16 1)), p0:(AND (GEQ s13 1) (GEQ s22 1)), p3:(GEQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2618 reset in 277 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 30 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-09 finished in 1499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(X(p0)))&&X(G(p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 13 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:20] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:20] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:20] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-21 19:52:20] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-10 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U G(!((p1 U p2)&&G(p3))))))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 79 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 47 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 47 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 39 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 38 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 36 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 36 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 34 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 34 transition count 56
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 32 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 32 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 32 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 29 transition count 45
Applied a total of 110 rules in 24 ms. Remains 29 /79 variables (removed 50) and now considering 45/118 (removed 73) transitions.
// Phase 1: matrix 45 rows 29 cols
[2022-05-21 19:52:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:20] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 45 rows 29 cols
[2022-05-21 19:52:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:20] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-21 19:52:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 29 cols
[2022-05-21 19:52:20] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:20] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/79 places, 45/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/79 places, 45/118 transitions.
Stuttering acceptance computed with spot in 435 ms :[(AND p2 p3), p3, (AND p2 p3), (AND p3 p2), (AND p2 p3), (AND p2 p3), (AND p3 p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={} source=0 dest: 5}], [{ cond=p3, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 p3), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p3), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p3 p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={1} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1) (GEQ s18 1)), p2:(GEQ s17 1), p3:(LT s22 1), p1:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1078 reset in 125 ms.
Stack based approach found an accepted trace after 314 steps with 4 reset with depth 14 and stack size 14 in 9 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-11 finished in 790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((p0 U p1))&&p2))||X(!p2)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:21] [INFO ] Implicit Places using invariants in 109 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 2}], [{ cond=p2, acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LT s40 1), p1:(LT s42 1), p0:(GEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23437 reset in 217 ms.
Stack based approach found an accepted trace after 5018 steps with 1247 reset with depth 11 and stack size 11 in 15 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-12 finished in 640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0)) U X(p1))) U X(p1)))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 9 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:21] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:21] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-21 19:52:21] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:22] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 94/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s40 1)), p0:(AND (GEQ s32 1) (GEQ s43 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-13 finished in 591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((!G(p0) U !F(p1)) U p2)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 55 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 55 transition count 94
Applied a total of 48 rules in 4 ms. Remains 55 /79 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 55 cols
[2022-05-21 19:52:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-21 19:52:22] [INFO ] Implicit Places using invariants in 84 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/79 places, 94/118 transitions.
Stuttering acceptance computed with spot in 416 ms :[p2, p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 7}, { cond=(AND p0 p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s38 1), p0:(AND (GEQ s34 1) (GEQ s45 1)), p1:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLFireability-15 finished in 545 ms.
All properties solved by simple procedures.
Total runtime 15600 ms.

BK_STOP 1653162743063

--------------------
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="UtilityControlRoom-PT-Z4T4N02"
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 UtilityControlRoom-PT-Z4T4N02, 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 r276-smll-165307353100244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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