About the Execution of LTSMin+red for UtilityControlRoom-COL-Z4T3N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7807.052 | 806549.00 | 2981465.00 | 622.90 | TTF?T?FFF??FFTF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707601036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is UtilityControlRoom-COL-Z4T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707601036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.1K Feb 26 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 14:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K Mar 5 18:23 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-Z4T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679336012847
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:13:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:13:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:13:34] [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.
[2023-03-20 18:13:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:13:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2023-03-20 18:13:35] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:13:35] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-20 18:13:35] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 112 steps, including 0 resets, run visited all 12 properties in 12 ms. (steps per millisecond=9 )
[2023-03-20 18:13:35] [INFO ] Flatten gal took : 15 ms
[2023-03-20 18:13:35] [INFO ] Flatten gal took : 2 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
[2023-03-20 18:13:35] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 27 ms.
[2023-03-20 18:13:35] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2023-03-20 18:13:35] [INFO ] Reduced 24 identical enabling conditions.
[2023-03-20 18:13:35] [INFO ] Reduced 24 identical enabling conditions.
[2023-03-20 18:13:35] [INFO ] Reduced 24 identical enabling conditions.
[2023-03-20 18:13:35] [INFO ] Reduced 24 identical enabling conditions.
[2023-03-20 18:13:35] [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 13 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-20 18:13:35] [INFO ] Computed 19 place invariants in 28 ms
[2023-03-20 18:13:35] [INFO ] Implicit Places using invariants in 252 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 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 LTL mode , in 2 iterations and 300 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2023-03-20 18:13:35] [INFO ] Flatten gal took : 53 ms
[2023-03-20 18:13:36] [INFO ] Flatten gal took : 65 ms
[2023-03-20 18:13:36] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 12 properties in 5 ms. (steps per millisecond=7 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((!(p0 U p1)&&G(!p0))))||F(p2)||!p0)))'
Support contains 173 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 7 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2023-03-20 18:13:36] [INFO ] Computed 18 place invariants in 8 ms
[2023-03-20 18:13:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-20 18:13:36] [INFO ] Invariant cache hit.
[2023-03-20 18:13:37] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-20 18:13:37] [INFO ] Invariant cache hit.
[2023-03-20 18:13:37] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (LT s259 1) (LT s260 1) (LT s255 1) (LT s256 1) (LT s257 1) (LT s258 1) (LT s253 1) (LT s254 1)), p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s244 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 794 ms.
Product exploration explored 100000 steps with 50000 reset in 764 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 finished in 2652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||X(p0)))'
Support contains 37 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 20 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:13:39] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:13:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 18:13:39] [INFO ] Invariant cache hit.
[2023-03-20 18:13:39] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-20 18:13:39] [INFO ] Invariant cache hit.
[2023-03-20 18:13:39] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s148 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23619 reset in 1684 ms.
Product exploration explored 100000 steps with 23657 reset in 1711 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:13:43] [INFO ] Invariant cache hit.
[2023-03-20 18:13:44] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2023-03-20 18:13:44] [INFO ] Invariant cache hit.
[2023-03-20 18:13:45] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2023-03-20 18:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:13:45] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-20 18:13:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:13:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-20 18:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:13:47] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-20 18:13:47] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-20 18:13:48] [INFO ] Added : 324 causal constraints over 65 iterations in 1750 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 37 out of 205 places. Attempting structural reductions.
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 1 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
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 1 with 16 rules applied. Total rules applied 176 place count 133 transition count 272
Applied a total of 176 rules in 37 ms. Remains 133 /205 variables (removed 72) and now considering 272/376 (removed 104) transitions.
// Phase 1: matrix 272 rows 133 cols
[2023-03-20 18:13:48] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:13:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 18:13:48] [INFO ] Invariant cache hit.
[2023-03-20 18:13:49] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-20 18:13:49] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-20 18:13:49] [INFO ] Invariant cache hit.
[2023-03-20 18:13:49] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/205 places, 272/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 133/205 places, 272/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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2023-03-20 18:13:49] [INFO ] Invariant cache hit.
[2023-03-20 18:13:50] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-20 18:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:13:50] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-20 18:13:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:13:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-20 18:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:13:51] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-20 18:13:51] [INFO ] Computed and/alt/rep : 232/512/232 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:13:51] [INFO ] Added : 138 causal constraints over 28 iterations in 454 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 44591 reset in 795 ms.
Product exploration explored 100000 steps with 44594 reset in 802 ms.
Support contains 37 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-20 18:13:53] [INFO ] Invariant cache hit.
[2023-03-20 18:13:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 18:13:53] [INFO ] Invariant cache hit.
[2023-03-20 18:13:53] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-20 18:13:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 18:13:53] [INFO ] Invariant cache hit.
[2023-03-20 18:13:53] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 133/133 places, 272/272 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-03 finished in 14448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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
[2023-03-20 18:13:53] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-20 18:13:53] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-20 18:13:53] [INFO ] Invariant cache hit.
[2023-03-20 18:13:54] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-20 18:13:54] [INFO ] Invariant cache hit.
[2023-03-20 18:13:54] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 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 (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, 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 50000 reset in 478 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 finished in 1656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
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 9 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:13:55] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:13:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 18:13:55] [INFO ] Invariant cache hit.
[2023-03-20 18:13:55] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-20 18:13:55] [INFO ] Invariant cache hit.
[2023-03-20 18:13:55] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT 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 (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, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12018 reset in 721 ms.
Product exploration explored 100000 steps with 11602 reset in 733 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2023-03-20 18:13:58] [INFO ] Invariant cache hit.
[2023-03-20 18:13:59] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-20 18:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:13:59] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-20 18:13:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-20 18:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:00] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-20 18:14:00] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-20 18:14:01] [INFO ] Added : 324 causal constraints over 65 iterations in 1626 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 37 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 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 64 place count 173 transition count 344
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 173 transition count 312
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 165 transition count 304
Applied a total of 112 rules in 28 ms. Remains 165 /205 variables (removed 40) and now considering 304/376 (removed 72) transitions.
// Phase 1: matrix 304 rows 165 cols
[2023-03-20 18:14:02] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-20 18:14:02] [INFO ] Invariant cache hit.
[2023-03-20 18:14:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-20 18:14:02] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 18:14:02] [INFO ] Invariant cache hit.
[2023-03-20 18:14:02] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/205 places, 304/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 165/205 places, 304/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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
[2023-03-20 18:14:03] [INFO ] Invariant cache hit.
[2023-03-20 18:14:03] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-20 18:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:04] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-20 18:14:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-20 18:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:04] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-20 18:14:04] [INFO ] Computed and/alt/rep : 264/448/264 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:14:05] [INFO ] Added : 165 causal constraints over 33 iterations in 579 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8417 reset in 672 ms.
Product exploration explored 100000 steps with 8220 reset in 683 ms.
Support contains 37 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 304/304 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 165 transition count 272
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 133 transition count 272
Applied a total of 64 rules in 9 ms. Remains 133 /165 variables (removed 32) and now considering 272/304 (removed 32) transitions.
// Phase 1: matrix 272 rows 133 cols
[2023-03-20 18:14:06] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 18:14:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 18:14:07] [INFO ] Invariant cache hit.
[2023-03-20 18:14:07] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-20 18:14:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:14:07] [INFO ] Invariant cache hit.
[2023-03-20 18:14:07] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/165 places, 272/304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 133/165 places, 272/304 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-05 finished in 11939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 72 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_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
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 288 place count 157 transition count 328
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 320 place count 157 transition count 296
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 323 place count 154 transition count 200
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 327 place count 153 transition count 200
Applied a total of 327 rules in 27 ms. Remains 153 /301 variables (removed 148) and now considering 200/472 (removed 272) transitions.
// Phase 1: matrix 200 rows 153 cols
[2023-03-20 18:14:07] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-20 18:14:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 18:14:07] [INFO ] Invariant cache hit.
[2023-03-20 18:14:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-20 18:14:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:14:07] [INFO ] Invariant cache hit.
[2023-03-20 18:14:07] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/301 places, 200/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 153/301 places, 200/472 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 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 2290 reset in 505 ms.
Stack based approach found an accepted trace after 6473 steps with 153 reset with depth 56 and stack size 56 in 35 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 finished in 862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0 U X(p1)) U G(p1)) U G(!p0)) U p0))'
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 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:14:08] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 18:14:08] [INFO ] Invariant cache hit.
[2023-03-20 18:14:08] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-20 18:14:08] [INFO ] Invariant cache hit.
[2023-03-20 18:14:08] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND p0 (NOT p1)), p0, true, (AND p0 p1), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}]], initial=0, aps=[p0:(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)), p1:(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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 2 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((X(G(!p1))||(X(!p1)&&(p1||F(!p2))))))))'
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.
[2023-03-20 18:14:08] [INFO ] Invariant cache hit.
[2023-03-20 18:14:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 18:14:09] [INFO ] Invariant cache hit.
[2023-03-20 18:14:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-20 18:14:09] [INFO ] Invariant cache hit.
[2023-03-20 18:14:09] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1, (AND p2 p1), p2]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, 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)), p1:(AND (LT s163 1) (LT s164 1) (LT s159 1) (LT s160 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 25 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-08 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U X(p1)))))'
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
[2023-03-20 18:14:09] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-20 18:14:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 18:14:09] [INFO ] Invariant cache hit.
[2023-03-20 18:14:09] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-20 18:14:09] [INFO ] Invariant cache hit.
[2023-03-20 18:14:10] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s245 1) (GEQ s246 1) (GEQ s251 1) (GEQ s252 1) (GEQ s247 1) (GEQ s248 1) (GEQ s249 1) (GEQ s250 1)), p1:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s13...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 4015 reset in 314 ms.
Product exploration explored 100000 steps with 4020 reset in 383 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-20 18:14:12] [INFO ] Invariant cache hit.
[2023-03-20 18:14:12] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-20 18:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:12] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-20 18:14:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-20 18:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:13] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-20 18:14:13] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-20 18:14:15] [INFO ] Added : 352 causal constraints over 71 iterations in 1953 ms. Result :sat
Could not prove EG (NOT p1)
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 2 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2023-03-20 18:14:15] [INFO ] Invariant cache hit.
[2023-03-20 18:14:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 18:14:15] [INFO ] Invariant cache hit.
[2023-03-20 18:14:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-20 18:14:15] [INFO ] Invariant cache hit.
[2023-03-20 18:14:15] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. 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 p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-20 18:14:16] [INFO ] Invariant cache hit.
[2023-03-20 18:14:16] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-20 18:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:16] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-20 18:14:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-20 18:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:17] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-20 18:14:17] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-20 18:14:19] [INFO ] Added : 352 causal constraints over 71 iterations in 1980 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3965 reset in 349 ms.
Product exploration explored 100000 steps with 3971 reset in 291 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
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 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 301 transition count 504
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 301 transition count 528
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 40 rules in 17 ms. Remains 301 /301 variables (removed 0) and now considering 528/472 (removed -56) transitions.
[2023-03-20 18:14:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 528 rows 301 cols
[2023-03-20 18:14:20] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-20 18:14:20] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/301 places, 528/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 301/301 places, 528/472 transitions.
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 2 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2023-03-20 18:14:20] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:14:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 18:14:20] [INFO ] Invariant cache hit.
[2023-03-20 18:14:21] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-20 18:14:21] [INFO ] Invariant cache hit.
[2023-03-20 18:14:21] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 301/301 places, 472/472 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-09 finished in 11686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(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 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:14:21] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:14:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 18:14:21] [INFO ] Invariant cache hit.
[2023-03-20 18:14:21] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-20 18:14:21] [INFO ] Invariant cache hit.
[2023-03-20 18:14:21] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s45 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2680 reset in 564 ms.
Product exploration explored 100000 steps with 2641 reset in 591 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[false, false, (NOT p1), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[false, false, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[false, false, (NOT p1), (NOT p1)]
Support contains 77 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 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 18:14:23] [INFO ] Invariant cache hit.
[2023-03-20 18:14:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 18:14:24] [INFO ] Invariant cache hit.
[2023-03-20 18:14:24] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-20 18:14:24] [INFO ] Invariant cache hit.
[2023-03-20 18:14:24] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. 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) p1), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2799 reset in 563 ms.
Product exploration explored 100000 steps with 2677 reset in 573 ms.
Support contains 69 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: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 197 transition count 368
Applied a total of 16 rules in 19 ms. Remains 197 /205 variables (removed 8) and now considering 368/376 (removed 8) transitions.
// Phase 1: matrix 368 rows 197 cols
[2023-03-20 18:14:26] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 18:14:26] [INFO ] Invariant cache hit.
[2023-03-20 18:14:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-20 18:14:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:14:26] [INFO ] Invariant cache hit.
[2023-03-20 18:14:26] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/205 places, 368/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 197/205 places, 368/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 finished in 5252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((F(G(!p1))||G(p2)))))))'
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 4 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:14:26] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:14:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 18:14:26] [INFO ] Invariant cache hit.
[2023-03-20 18:14:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-20 18:14:26] [INFO ] Invariant cache hit.
[2023-03-20 18:14:26] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3375 ms.
Product exploration explored 100000 steps with 0 reset in 3388 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) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 16 factoid took 792 ms. Reduced automaton from 5 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 18:14:35] [INFO ] Invariant cache hit.
[2023-03-20 18:14:36] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 19 factoid took 1153 ms. Reduced automaton from 5 states, 26 edges and 3 AP (stutter sensitive) to 5 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-20 18:14:37] [INFO ] Invariant cache hit.
[2023-03-20 18:14:38] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-20 18:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:38] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-20 18:14:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-20 18:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:39] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-20 18:14:40] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-20 18:14:41] [INFO ] Added : 324 causal constraints over 65 iterations in 1615 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 77 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
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 64 place count 173 transition count 344
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 173 transition count 312
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 1 with 16 rules applied. Total rules applied 112 place count 165 transition count 304
Applied a total of 112 rules in 17 ms. Remains 165 /205 variables (removed 40) and now considering 304/376 (removed 72) transitions.
// Phase 1: matrix 304 rows 165 cols
[2023-03-20 18:14:41] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 18:14:41] [INFO ] Invariant cache hit.
[2023-03-20 18:14:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-20 18:14:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:14:41] [INFO ] Invariant cache hit.
[2023-03-20 18:14:41] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/205 places, 304/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 165/205 places, 304/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) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 775 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter insensitive) to 5 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 170 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F p0), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p0) p2)), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 950 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter insensitive) to 5 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-20 18:14:44] [INFO ] Invariant cache hit.
[2023-03-20 18:14:45] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-20 18:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:45] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-20 18:14:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-20 18:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:45] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-20 18:14:46] [INFO ] Computed and/alt/rep : 264/448/264 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-20 18:14:46] [INFO ] Added : 165 causal constraints over 33 iterations in 572 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2167 ms.
Stack based approach found an accepted trace after 1959 steps with 0 reset with depth 1960 and stack size 1960 in 43 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 finished in 22529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 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
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 559 place count 49 transition count 48
Applied a total of 559 rules in 23 ms. Remains 49 /301 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 49 cols
[2023-03-20 18:14:49] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-20 18:14:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 18:14:49] [INFO ] Invariant cache hit.
[2023-03-20 18:14:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-20 18:14:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:14:49] [INFO ] Invariant cache hit.
[2023-03-20 18:14:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/301 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s27 1) (GEQ s26 1) (GEQ s25 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 1340 steps with 0 reset with depth 1341 and stack size 1341 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--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 12 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:14:49] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 18:14:49] [INFO ] Invariant cache hit.
[2023-03-20 18:14:49] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-20 18:14:49] [INFO ] Invariant cache hit.
[2023-03-20 18:14:49] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-14 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:(AND (LT s163 1) (LT s164 1) (LT s159 1) (LT s160 1) (LT s161 1) (LT s162 1) (LT s157 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-14 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (F(G(p1)) U p1))))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.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
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 368 place count 133 transition count 272
Applied a total of 368 rules in 20 ms. Remains 133 /301 variables (removed 168) and now considering 272/472 (removed 200) transitions.
// Phase 1: matrix 272 rows 133 cols
[2023-03-20 18:14:49] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:14:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 18:14:49] [INFO ] Invariant cache hit.
[2023-03-20 18:14:50] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-20 18:14:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:14:50] [INFO ] Invariant cache hit.
[2023-03-20 18:14:50] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/301 places, 272/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 133/301 places, 272/472 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s77 1) (GEQ s78 1) (GEQ s83 1) (GEQ s84 1) (GEQ s79 1) (GEQ s80 1) (GEQ s81 1) (GEQ s82 1)), p0:(OR (AND (GEQ s1 1) (GEQ s11 1) (GEQ s76 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 26336 reset in 484 ms.
Product exploration explored 100000 steps with 26236 reset in 494 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 418 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-20 18:14:52] [INFO ] Invariant cache hit.
[2023-03-20 18:14:52] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-20 18:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:52] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-20 18:14:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-20 18:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:52] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-20 18:14:52] [INFO ] Computed and/alt/rep : 232/512/232 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:14:53] [INFO ] Added : 144 causal constraints over 29 iterations in 429 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 45 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-20 18:14:53] [INFO ] Invariant cache hit.
[2023-03-20 18:14:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-20 18:14:53] [INFO ] Invariant cache hit.
[2023-03-20 18:14:53] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-20 18:14:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:14:53] [INFO ] Invariant cache hit.
[2023-03-20 18:14:53] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 133/133 places, 272/272 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 469 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-20 18:14:54] [INFO ] Invariant cache hit.
[2023-03-20 18:14:54] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-20 18:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:54] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-20 18:14:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:14:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-20 18:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:14:54] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-20 18:14:54] [INFO ] Computed and/alt/rep : 232/512/232 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-20 18:14:55] [INFO ] Added : 144 causal constraints over 29 iterations in 434 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 26370 reset in 509 ms.
Product exploration explored 100000 steps with 26348 reset in 518 ms.
Support contains 45 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-20 18:14:56] [INFO ] Invariant cache hit.
[2023-03-20 18:14:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 18:14:56] [INFO ] Invariant cache hit.
[2023-03-20 18:14:56] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-20 18:14:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:14:56] [INFO ] Invariant cache hit.
[2023-03-20 18:14:56] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 133/133 places, 272/272 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-15 finished in 7015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||X(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-10
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 77 out of 301 places. Attempting structural reductions.
Starting structural reductions in LI_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 16 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:14:57] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:14:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 18:14:57] [INFO ] Invariant cache hit.
[2023-03-20 18:14:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-20 18:14:57] [INFO ] Invariant cache hit.
[2023-03-20 18:14:57] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 397 ms. Remains : 205/301 places, 376/472 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s45 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2656 reset in 560 ms.
Product exploration explored 100000 steps with 2714 reset in 565 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[false, false, (NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[false, false, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[false, false, (NOT p1), (NOT p1)]
Support contains 77 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 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 18:14:59] [INFO ] Invariant cache hit.
[2023-03-20 18:14:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 18:14:59] [INFO ] Invariant cache hit.
[2023-03-20 18:15:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-20 18:15:00] [INFO ] Invariant cache hit.
[2023-03-20 18:15:00] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. 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) p1), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2737 reset in 562 ms.
Product exploration explored 100000 steps with 2649 reset in 576 ms.
Support contains 69 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: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 197 transition count 368
Applied a total of 16 rules in 18 ms. Remains 197 /205 variables (removed 8) and now considering 368/376 (removed 8) transitions.
// Phase 1: matrix 368 rows 197 cols
[2023-03-20 18:15:02] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 18:15:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 18:15:02] [INFO ] Invariant cache hit.
[2023-03-20 18:15:02] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-20 18:15:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:15:02] [INFO ] Invariant cache hit.
[2023-03-20 18:15:02] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/205 places, 368/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 197/205 places, 368/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 finished in 5236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (F(G(p1)) U p1))))'
[2023-03-20 18:15:02] [INFO ] Flatten gal took : 32 ms
[2023-03-20 18:15:02] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2023-03-20 18:15:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 472 transitions and 1376 arcs took 2 ms.
Total runtime 88248 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2621/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 8370316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16126860 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2621/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2621/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2621/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2621/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLFireability-03
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLFireability-05
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLFireability-09
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLFireability-10
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLFireability-15
BK_STOP 1679336819396
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLFireability-03
ltl formula formula --ltl=/tmp/2621/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 301 places, 472 transitions and 1376 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2621/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2621/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2621/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2621/ltl_0_
Killing (15) : 2627 2628 2629 2630 2631
Killing (9) : 2627 2628 2629 2630 2631
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLFireability-05
ltl formula formula --ltl=/tmp/2621/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 301 places, 472 transitions and 1376 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2621/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2621/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2621/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2621/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLFireability-09
ltl formula formula --ltl=/tmp/2621/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 301 places, 472 transitions and 1376 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2621/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2621/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2621/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2621/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLFireability-10
ltl formula formula --ltl=/tmp/2621/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 301 places, 472 transitions and 1376 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2621/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2621/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2621/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2621/ltl_3_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLFireability-15
ltl formula formula --ltl=/tmp/2621/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 301 places, 472 transitions and 1376 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.030 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2621/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2621/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2621/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2621/ltl_4_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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-Z4T3N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T3N08, 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 r489-tall-167912707601036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T3N08.tgz
mv UtilityControlRoom-COL-Z4T3N08 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 ;