About the Execution of ITS-Tools for UtilityControlRoom-COL-Z4T4N08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
471.451 | 59827.00 | 89432.00 | 569.10 | TFFTFFFFFFFTFFFF | 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-165307353000132.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-COL-Z4T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353000132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z4T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653137211774
Running Version 202205111006
[2022-05-21 12:46:54] [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 12:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 12:46:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 12:46:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 12:46:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1433 ms
[2022-05-21 12:46:55] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 12:46:55] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 10 ms.
[2022-05-21 12:46:55] [INFO ] Skeletonized 16 HLPN properties in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 174 steps, including 0 resets, run visited all 11 properties in 34 ms. (steps per millisecond=5 )
[2022-05-21 12:46:56] [INFO ] Flatten gal took : 24 ms
[2022-05-21 12:46:56] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 12:46:56] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 39 ms.
[2022-05-21 12:46:56] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2022-05-21 12:46:56] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 269 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2022-05-21 12:46:56] [INFO ] Computed 19 place invariants in 29 ms
[2022-05-21 12:46:56] [INFO ] Implicit Places using invariants in 428 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2022-05-21 12:46:57] [INFO ] Flatten gal took : 82 ms
[2022-05-21 12:46:57] [INFO ] Flatten gal took : 104 ms
[2022-05-21 12:46:57] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 83 steps, including 0 resets, run visited all 15 properties in 13 ms. (steps per millisecond=6 )
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(!(p0 U ((G(p0)||p1) U p2))))'
Support contains 168 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:46:58] [INFO ] Computed 18 place invariants in 20 ms
[2022-05-21 12:46:58] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:46:58] [INFO ] Computed 18 place invariants in 10 ms
[2022-05-21 12:46:58] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:46:58] [INFO ] Computed 18 place invariants in 9 ms
[2022-05-21 12:46:59] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 531 ms :[true, p0, p2, (AND p0 p2), p2, p2]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (AND (GEQ s204 1) (GEQ s261 1)) (AND (GEQ s209 1) (GEQ s262 1)) (AND (GEQ s219 1) (GEQ s264 1)) (AND (GEQ s229 1) (GEQ s267 1)) (AND (GEQ s224 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]]
Product exploration explored 100000 steps with 50000 reset in 1045 ms.
Product exploration explored 100000 steps with 50000 reset in 912 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 10 factoid took 301 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-00 finished in 4199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X((!p0 U X(!G(F((G(p1)&&p0))))))))))'
Support contains 160 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 253 transition count 424
Applied a total of 96 rules in 49 ms. Remains 253 /301 variables (removed 48) and now considering 424/472 (removed 48) transitions.
// Phase 1: matrix 424 rows 253 cols
[2022-05-21 12:47:02] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-21 12:47:02] [INFO ] Implicit Places using invariants in 239 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/301 places, 424/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 252 /252 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 252/301 places, 424/472 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], 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 3083 reset in 750 ms.
Stack based approach found an accepted trace after 54226 steps with 1664 reset with depth 83 and stack size 83 in 385 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-01 finished in 1534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 77 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 34 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:03] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:03] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:03] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:04] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:04] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-21 12:47:04] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (OR (LT s137 1) (LT s164 1)) (OR (LT s122 1) (LT s160 1)) (OR (LT s112 1) (LT s158 1)) (OR (LT s117 1) (LT s159 1)) (OR (LT s113 1) (LT s158 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-02 finished in 809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 12 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:04] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:04] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:04] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:05] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:05] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:05] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s163 1) (GEQ s164 1) (GEQ s159 1) (GEQ s160 1) (GEQ s161 1) (GEQ s162 1) (GEQ s157 1) (GEQ s158 1)), p1:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Product exploration explored 100000 steps with 50000 reset in 444 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 p0)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-03 finished in 1848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U (F(G(!(p0 U p1)))&&p2))))'
Support contains 53 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:06] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:06] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:06] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:06] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:07] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p0, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GEQ s143 1) (GEQ s142 1) (GEQ s141 1) (GEQ s140 1)), p0:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s...], 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 324 ms.
Product exploration explored 100000 steps with 0 reset in 423 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 69 ms :[false, p1]
Finished random walk after 37 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 352 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[p1]
Stuttering acceptance computed with spot in 32 ms :[p1]
Support contains 8 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 344
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 173 transition count 344
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 141 transition count 312
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 160 place count 141 transition count 280
Applied a total of 160 rules in 23 ms. Remains 141 /205 variables (removed 64) and now considering 280/376 (removed 96) transitions.
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 12:47:09] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:09] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 12:47:09] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:09] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-05-21 12:47:09] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 12:47:09] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:09] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/205 places, 280/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/205 places, 280/376 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[p1]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 32 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 453 ms.
Built C files in :
/tmp/ltsmin6787866138224401731
[2022-05-21 12:47:10] [INFO ] Computing symmetric may disable matrix : 280 transitions.
[2022-05-21 12:47:10] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:47:10] [INFO ] Computing symmetric may enable matrix : 280 transitions.
[2022-05-21 12:47:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:47:10] [INFO ] Computing Do-Not-Accords matrix : 280 transitions.
[2022-05-21 12:47:10] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:47:10] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6787866138224401731
Running compilation step : cd /tmp/ltsmin6787866138224401731;'/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 1045 ms.
Running link step : cd /tmp/ltsmin6787866138224401731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6787866138224401731;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12821459631682719036.hoa' '--buchi-type=spotba'
LTSmin run took 356 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-04 finished in 5962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(!p0)||p1)))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:12] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:12] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:12] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 12:47:12] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:12] [INFO ] Computed 18 place invariants in 15 ms
[2022-05-21 12:47:13] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], 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 5 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-05 finished in 1214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0)||!p1) U (X(G(F(p1)))&&X(p0))))'
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:13] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:13] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:13] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 12:47:14] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:14] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 12:47:14] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], 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 2222 reset in 422 ms.
Product exploration explored 100000 steps with 2208 reset in 434 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), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:17] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:17] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-21 12:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:17] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-21 12:47:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:47:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-21 12:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:18] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-05-21 12:47:18] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-21 12:47:21] [INFO ] Added : 408 causal constraints over 82 iterations in 3118 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:21] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:22] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:22] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 12:47:22] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:22] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:22] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 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 (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:23] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:24] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-21 12:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:24] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-21 12:47:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:47:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-21 12:47:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:25] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2022-05-21 12:47:25] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-21 12:47:28] [INFO ] Added : 408 causal constraints over 82 iterations in 2848 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2237 reset in 473 ms.
Product exploration explored 100000 steps with 2225 reset in 497 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 301 transition count 504
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 72 place count 301 transition count 528
Deduced a syphon composed of 72 places in 1 ms
Applied a total of 72 rules in 35 ms. Remains 301 /301 variables (removed 0) and now considering 528/472 (removed -56) transitions.
[2022-05-21 12:47:30] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 528 rows 301 cols
[2022-05-21 12:47:30] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 12:47:30] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 528/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 528/472 transitions.
Product exploration explored 100000 steps with 3884 reset in 883 ms.
Stack based approach found an accepted trace after 2155 steps with 85 reset with depth 7 and stack size 6 in 27 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-06 finished in 17755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)&&p0))))'
Support contains 48 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 170 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 170 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 146 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 146 transition count 192
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 358 place count 138 transition count 184
Applied a total of 358 rules in 24 ms. Remains 138 /301 variables (removed 163) and now considering 184/472 (removed 288) transitions.
// Phase 1: matrix 184 rows 138 cols
[2022-05-21 12:47:31] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 12:47:31] [INFO ] Implicit Places using invariants in 106 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/301 places, 184/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 137/301 places, 184/472 transitions.
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s105 1) (LT s106 1) (LT s111 1) (LT s112 1) (LT s107 1) (LT s108 1) (LT s109 1) (LT s110 1)), p1:(AND (OR (LT s101 1) (LT s120 1)) (OR (LT s86...], 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 376 ms.
Stack based approach found an accepted trace after 6752 steps with 0 reset with depth 6753 and stack size 6753 in 34 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-07 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 48 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:32] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:32] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:32] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 12:47:32] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:32] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-21 12:47:32] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, 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}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (LT s137 1) (LT s164 1)) (OR (LT s122 1) (LT s160 1)) (OR (LT s112 1) (LT s158 1)) (OR (LT s117 1) (LT s159 1)) (OR (LT s113 1) (LT s158 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-08 finished in 954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(X(X(G(p0)))))||G(p1)))))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:33] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 12:47:33] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:33] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 12:47:33] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:33] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:33] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}, { cond=p1, acceptance={} source=9 dest: 7}]], initial=8, aps=[p0:(OR (AND (LT s131 1) (LT s192 1) (LT s135 1) (LT s196 1) (LT s139 1) (LT s200 1) (LT s143 1) (LT s78 1) (LT s147 1) (LT s82 1) (LT s151 1) (LT s86 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-09 finished in 1110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 4 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:34] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:34] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:34] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:34] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:34] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:34] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s108 1) (GEQ s165 1)) (AND (GEQ s113 1) (GEQ s166 1)) (AND (GEQ s123 1) (GEQ s168 1)) (AND (GEQ s133 1) (GEQ s171 1)) (AND (GEQ s128 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 4248 reset in 389 ms.
Product exploration explored 100000 steps with 4292 reset in 406 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:36] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:36] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2022-05-21 12:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:36] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-21 12:47:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:47:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2022-05-21 12:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:37] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-05-21 12:47:37] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-21 12:47:38] [INFO ] Added : 280 causal constraints over 56 iterations in 1548 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 125 transition count 296
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 192 place count 125 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 122 transition count 168
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 121 transition count 168
Applied a total of 199 rules in 13 ms. Remains 121 /205 variables (removed 84) and now considering 168/376 (removed 208) transitions.
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:38] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-05-21 12:47:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:38] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-21 12:47:39] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/205 places, 168/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/205 places, 168/376 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:39] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-21 12:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:39] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-21 12:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:47:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-21 12:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:47:40] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-21 12:47:40] [INFO ] Computed and/alt/rep : 136/320/136 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 12:47:40] [INFO ] Added : 87 causal constraints over 18 iterations in 280 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5478 reset in 374 ms.
Stack based approach found an accepted trace after 431 steps with 22 reset with depth 11 and stack size 11 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-10 finished in 6665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(G(!(p1 U p2)))))'
Support contains 40 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 4 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:40] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:40] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:40] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:41] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:41] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 12:47:41] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p2:(OR (GEQ s149 1) (GEQ s150 1) (GEQ s155 1) (GEQ s156 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1)), p0:(AND (OR (GEQ s65 1) (GEQ s64 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2752 reset in 400 ms.
Product exploration explored 100000 steps with 2727 reset in 426 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 p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 63 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:43] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:43] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:43] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:43] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:43] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:43] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 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 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 40 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 2765 reset in 500 ms.
Product exploration explored 100000 steps with 2747 reset in 534 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 205 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 40 place count 205 transition count 368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 202 transition count 272
Deduced a syphon composed of 8 places in 4 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 202 transition count 272
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 70 place count 178 transition count 248
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 94 place count 178 transition count 248
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 118 place count 154 transition count 200
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 142 place count 154 transition count 200
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 142 rules in 35 ms. Remains 154 /205 variables (removed 51) and now considering 200/376 (removed 176) transitions.
[2022-05-21 12:47:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 154 cols
[2022-05-21 12:47:45] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 12:47:46] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/205 places, 200/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/205 places, 200/376 transitions.
Product exploration explored 100000 steps with 3044 reset in 600 ms.
Product exploration explored 100000 steps with 3022 reset in 560 ms.
Built C files in :
/tmp/ltsmin12648711756448581960
[2022-05-21 12:47:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12648711756448581960
Running compilation step : cd /tmp/ltsmin12648711756448581960;'/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 858 ms.
Running link step : cd /tmp/ltsmin12648711756448581960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12648711756448581960;'/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/stateBased1341522968998239884.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-12 finished in 7469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 15 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 12:47:48] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:48] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:48] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 12:47:48] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 12:47:48] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 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: 2}]], initial=1, aps=[p0:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 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 54 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-13 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X((p0 U (X(G(p1))&&p0)))))))'
Support contains 136 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:49] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:49] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:49] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 12:47:49] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 12:47:49] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 12:47:50] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-14 finished in 1276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U X(G(!G((!p0 U G(p0)))))))'
Support contains 40 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 170 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 170 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 146 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 146 transition count 192
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 391 place count 121 transition count 168
Applied a total of 391 rules in 39 ms. Remains 121 /301 variables (removed 180) and now considering 168/472 (removed 304) transitions.
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:50] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:50] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:50] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:50] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-21 12:47:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 12:47:50] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 12:47:50] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/301 places, 168/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/301 places, 168/472 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s101 1) (GEQ s112 1)) (AND (GEQ s86 1) (GEQ s108 1)) (AND (GEQ s76 1) (GEQ s106 1)) (AND (GEQ s81 1) (GEQ s107 1)) (AND (GEQ s77 1) (GEQ ...], 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 2935 reset in 380 ms.
Stack based approach found an accepted trace after 32387 steps with 933 reset with depth 28 and stack size 28 in 128 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLFireability-15 finished in 1085 ms.
All properties solved by simple procedures.
Total runtime 57406 ms.
BK_STOP 1653137271601
--------------------
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-COL-Z4T4N08"
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-COL-Z4T4N08, 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-165307353000132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N08.tgz
mv UtilityControlRoom-COL-Z4T4N08 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 '
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 ;