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-165307353100236.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-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 64K Apr 29 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 302K Apr 29 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 29 17:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 543K Apr 29 17:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 126K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.5K May 9 09:20 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 319K 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-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653162475259

Running Version 202205111006
[2022-05-21 19:47:57] [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:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 19:47:58] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-05-21 19:47:58] [INFO ] Transformed 376 places.
[2022-05-21 19:47:58] [INFO ] Transformed 750 transitions.
[2022-05-21 19:47:58] [INFO ] Parsed PT model containing 376 places and 750 transitions in 459 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2022-05-21 19:47:58] [INFO ] Reduced 30 identical enabling conditions.
[2022-05-21 19:47:58] [INFO ] Reduced 30 identical enabling conditions.
[2022-05-21 19:47:58] [INFO ] Reduced 30 identical enabling conditions.
[2022-05-21 19:47:58] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 177 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 118 place count 258 transition count 472
Iterating global reduction 0 with 118 rules applied. Total rules applied 236 place count 258 transition count 472
Applied a total of 236 rules in 51 ms. Remains 258 /376 variables (removed 118) and now considering 472/590 (removed 118) transitions.
// Phase 1: matrix 472 rows 258 cols
[2022-05-21 19:47:58] [INFO ] Computed 23 place invariants in 54 ms
[2022-05-21 19:47:59] [INFO ] Implicit Places using invariants in 576 ms returned [187]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 621 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/376 places, 472/590 transitions.
Applied a total of 0 rules in 11 ms. Remains 257 /257 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 257/376 places, 472/590 transitions.
Support contains 177 out of 257 places after structural reductions.
[2022-05-21 19:47:59] [INFO ] Flatten gal took : 132 ms
[2022-05-21 19:47:59] [INFO ] Flatten gal took : 102 ms
[2022-05-21 19:48:00] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 838 steps, including 0 resets, run visited all 27 properties in 94 ms. (steps per millisecond=8 )
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0)||G(p1)))'
Support contains 55 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 470
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 255 transition count 469
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 5 place count 255 transition count 429
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 85 place count 215 transition count 429
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 165 place count 175 transition count 389
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 204 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 224 place count 165 transition count 340
Applied a total of 224 rules in 81 ms. Remains 165 /257 variables (removed 92) and now considering 340/472 (removed 132) transitions.
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:00] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:01] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:01] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:01] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2022-05-21 19:48:01] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:01] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:01] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/257 places, 340/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/257 places, 340/472 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (LT s97 1) (LT s98 1) (LT s100 1) (LT s99 1) (LT s95 1) (LT s96 1) (LT s102 1) (LT s101 1) (LT s104 1) (LT s103 1)) (AND (OR (LT s2 1) (LT s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 5 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 1208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||F(!(X(F(p2)) U X(p0)))))'
Support contains 100 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 20 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:02] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:02] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:02] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:02] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:02] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-21 19:48:02] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (GEQ s174 1) (GEQ s175 1) (GEQ s180 1) (GEQ s181 1) (GEQ s182 1) (GEQ s183 1) (GEQ s176 1) (GEQ s177 1) (GEQ s178 1) (GEQ s179 1)) (OR (GEQ s6...], nbAcceptance=2, 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 0 reset in 1259 ms.
Stack based approach found an accepted trace after 19540 steps with 0 reset with depth 19541 and stack size 7924 in 222 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 2483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G((F(p1)||p0))) U !p2) U p3))'
Support contains 65 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 9 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:04] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-21 19:48:04] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:04] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:04] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:04] [INFO ] Computed 22 place invariants in 17 ms
[2022-05-21 19:48:05] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p3), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(OR (GEQ s204 1) (GEQ s203 1) (GEQ s200 1) (GEQ s199 1) (GEQ s202 1) (GEQ s201 1) (GEQ s196 1) (GEQ s195 1) (GEQ s198 1) (GEQ s197 1)), p2:(AND (OR (GE...], 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 50000 reset in 707 ms.
Product exploration explored 100000 steps with 50000 reset in 422 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 p3) (NOT p2) (NOT p0) p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X p3), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p2) (NOT p0) p1)
Knowledge based reduction with 9 factoid took 418 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 2691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((!p1 U (G(!p1)||p2)))&&p0))))'
Support contains 60 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 10 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:07] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:07] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:07] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:07] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:07] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:07] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s138 1) (LT s206 1)) (OR (LT s158 1) (LT s211 1)) (OR (LT s163 1) (LT s212 1)) (OR (LT s162 1) (LT s212 1)) (OR (LT s142 1) (LT s207 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 20 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 finished in 951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((F(G(p0))||p1)))))'
Support contains 95 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 24 place count 245 transition count 460
Applied a total of 24 rules in 30 ms. Remains 245 /257 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 245 cols
[2022-05-21 19:48:08] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:08] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 460 rows 245 cols
[2022-05-21 19:48:08] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:08] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2022-05-21 19:48:08] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 460 rows 245 cols
[2022-05-21 19:48:08] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-21 19:48:08] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/257 places, 460/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 245/257 places, 460/472 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s30 1) (LT s174 1)) (OR (LT s0 1) (LT s16 1) (LT s174 1)) (OR (LT s1 1) (LT s33 1) (LT s174 1)) (OR (LT s2 1) (LT s10 1) (LT s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2239 reset in 784 ms.
Stack based approach found an accepted trace after 73004 steps with 1625 reset with depth 54 and stack size 54 in 587 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 finished in 2178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 45 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 470
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 255 transition count 469
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 5 place count 255 transition count 429
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 85 place count 215 transition count 429
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 165 place count 175 transition count 389
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 204 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 224 place count 165 transition count 340
Applied a total of 224 rules in 38 ms. Remains 165 /257 variables (removed 92) and now considering 340/472 (removed 132) transitions.
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:10] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:10] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:10] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2022-05-21 19:48:10] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 340 rows 165 cols
[2022-05-21 19:48:10] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:10] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/257 places, 340/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/257 places, 340/472 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s30 1) (GEQ s94 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s94 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s94 1)) (AND (GEQ s2 1) (GEQ s10...], 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 2727 ms.
Stack based approach found an accepted trace after 19963 steps with 0 reset with depth 19964 and stack size 11172 in 485 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 finished in 3803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F((p0&&X(F(p1)))))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 7 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:14] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:14] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:14] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:14] [INFO ] Computed 22 place invariants in 9 ms
[2022-05-21 19:48:15] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s199 1), p1:(GEQ s11 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]]
Product exploration explored 100000 steps with 2120 reset in 309 ms.
Product exploration explored 100000 steps with 2088 reset in 548 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:17] [INFO ] Computed 22 place invariants in 10 ms
[2022-05-21 19:48:17] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 3546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 10 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:17] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:17] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:17] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:18] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:18] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-21 19:48:18] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s203 1), p1:(GEQ s197 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][false, false]]
Product exploration explored 100000 steps with 11455 reset in 470 ms.
Product exploration explored 100000 steps with 11585 reset in 504 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:20] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:20] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 3229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((G(F(p0))&&(F(G(!p0))||p1))))))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 12 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:20] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:21] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:21] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:21] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:21] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-21 19:48:21] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s18 1) (LT s184 1)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 221 reset in 412 ms.
Product exploration explored 100000 steps with 209 reset in 354 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 p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 355 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 432 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:24] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:24] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:24] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:24] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:24] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:25] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/255 places, 470/470 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 p0), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 356 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 150 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 p0), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 467 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 210 reset in 335 ms.
Product exploration explored 100000 steps with 219 reset in 353 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0)]
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 0 with 79 rules applied. Total rules applied 119 place count 255 transition count 537
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 159 place count 255 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 161 place count 253 transition count 417
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 253 transition count 417
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 223 place count 193 transition count 317
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 283 place count 193 transition count 317
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 322 place count 154 transition count 259
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 361 place count 154 transition count 259
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 398 place count 154 transition count 222
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 398 rules in 65 ms. Remains 154 /255 variables (removed 101) and now considering 222/470 (removed 248) transitions.
[2022-05-21 19:48:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 222 rows 154 cols
[2022-05-21 19:48:28] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:28] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/255 places, 222/470 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/255 places, 222/470 transitions.
Product exploration explored 100000 steps with 557 reset in 369 ms.
Product exploration explored 100000 steps with 588 reset in 416 ms.
Built C files in :
/tmp/ltsmin13202511338719458189
[2022-05-21 19:48:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13202511338719458189
Running compilation step : cd /tmp/ltsmin13202511338719458189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1338 ms.
Running link step : cd /tmp/ltsmin13202511338719458189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13202511338719458189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1208919553760585059.hoa' '--buchi-type=spotba'
LTSmin run took 341 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 finished in 10407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p1)&&p0))||G(p2)))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 257 transition count 471
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 3 place count 256 transition count 470
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 3 place count 256 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 83 place count 216 transition count 430
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 219 place count 148 transition count 362
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 258 place count 148 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 147 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 147 transition count 283
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 270 place count 137 transition count 263
Iterating global reduction 3 with 10 rules applied. Total rules applied 280 place count 137 transition count 263
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 288 place count 129 transition count 239
Iterating global reduction 3 with 8 rules applied. Total rules applied 296 place count 129 transition count 239
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 304 place count 129 transition count 231
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 308 place count 127 transition count 229
Applied a total of 308 rules in 36 ms. Remains 127 /257 variables (removed 130) and now considering 229/472 (removed 243) transitions.
// Phase 1: matrix 229 rows 127 cols
[2022-05-21 19:48:31] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 19:48:31] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 229 rows 127 cols
[2022-05-21 19:48:31] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 19:48:31] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-05-21 19:48:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 229 rows 127 cols
[2022-05-21 19:48:31] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 19:48:31] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/257 places, 229/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/257 places, 229/472 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s73 1) (LT s6 1)), p2:(OR (LT s2 1) (LT s30 1) (LT s76 1)), p1:(OR (LT s0 1) (LT s24 1) (LT s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 finished in 943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(F(p1))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 470
Applied a total of 4 rules in 18 ms. Remains 255 /257 variables (removed 2) and now considering 470/472 (removed 2) transitions.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:32] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:32] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:32] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:32] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 470 rows 255 cols
[2022-05-21 19:48:33] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:33] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/257 places, 470/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/257 places, 470/472 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s193 1), p1:(GEQ s189 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 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 1434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X((G(p1)&&p2)))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 472/472 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 256 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 256 transition count 471
Applied a total of 2 rules in 10 ms. Remains 256 /257 variables (removed 1) and now considering 471/472 (removed 1) transitions.
// Phase 1: matrix 471 rows 256 cols
[2022-05-21 19:48:33] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 19:48:33] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 471 rows 256 cols
[2022-05-21 19:48:33] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 19:48:34] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 256 cols
[2022-05-21 19:48:34] [INFO ] Computed 22 place invariants in 21 ms
[2022-05-21 19:48:34] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/257 places, 471/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/257 places, 471/472 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s11 1), p2:(LT s176 1), p1:(GEQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4068 reset in 567 ms.
Product exploration explored 100000 steps with 4241 reset in 594 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) p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 836 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 9355 steps, including 2 resets, run visited all 8 properties in 443 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 879 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 471 rows 256 cols
[2022-05-21 19:48:39] [INFO ] Computed 22 place invariants in 3 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 806 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 7002 ms.
All properties solved by simple procedures.
Total runtime 42995 ms.

BK_STOP 1653162520841

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-Z4T3N10"
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-Z4T3N10, 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-165307353100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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