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.r487-tall-167912703901044.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 lolaxred
Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703901044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.4K Feb 26 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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 18K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 14:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 14:50 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-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679230748894

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 12:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 12:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:59:10] [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-19 12:59:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 12:59:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2023-03-19 12:59:11] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 12:59:11] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2023-03-19 12:59:11] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 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 50 steps, including 0 resets, run visited all 9 properties in 7 ms. (steps per millisecond=7 )
[2023-03-19 12:59:11] [INFO ] Flatten gal took : 14 ms
[2023-03-19 12:59:11] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-19 12:59:11] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 22 ms.
[2023-03-19 12:59:11] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2023-03-19 12:59:11] [INFO ] Reduced 30 identical enabling conditions.
[2023-03-19 12:59:11] [INFO ] Reduced 30 identical enabling conditions.
[2023-03-19 12:59:11] [INFO ] Reduced 30 identical enabling conditions.
[2023-03-19 12:59:11] [INFO ] Reduced 30 identical enabling conditions.
[2023-03-19 12:59:11] [INFO ] Reduced 30 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 335 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-19 12:59:11] [INFO ] Computed 23 place invariants in 24 ms
[2023-03-19 12:59:11] [INFO ] Implicit Places using invariants in 219 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 335 out of 375 places after structural reductions.
[2023-03-19 12:59:11] [INFO ] Flatten gal took : 53 ms
[2023-03-19 12:59:12] [INFO ] Flatten gal took : 59 ms
[2023-03-19 12:59:12] [INFO ] Input system was already deterministic with 590 transitions.
Finished random walk after 142 steps, including 0 resets, run visited all 12 properties in 21 ms. (steps per millisecond=6 )
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(G(p0))))'
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 29 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:59:12] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-19 12:59:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-19 12:59:12] [INFO ] Invariant cache hit.
[2023-03-19 12:59:12] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-19 12:59:12] [INFO ] Invariant cache hit.
[2023-03-19 12:59:13] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s142 1) (LT s197 1)) (OR (LT s162 1) (LT s202 1)) (OR (LT s152 1) (LT s199 1)) (OR (LT s137 1) (LT s195 1)) (OR (LT s167 1) (LT s203 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-00 finished in 815 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(F(p0)))'
Support contains 160 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 550
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 335 transition count 550
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 200 place count 275 transition count 490
Applied a total of 200 rules in 45 ms. Remains 275 /375 variables (removed 100) and now considering 490/590 (removed 100) transitions.
// Phase 1: matrix 490 rows 275 cols
[2023-03-19 12:59:13] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-19 12:59:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 12:59:13] [INFO ] Invariant cache hit.
[2023-03-19 12:59:13] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-19 12:59:13] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 12:59:13] [INFO ] Invariant cache hit.
[2023-03-19 12:59:13] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/375 places, 490/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 275/375 places, 490/590 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s131 1) (LT s192 1) (LT s135 1) (LT s196 1) (LT s139 1) (LT s200 1) (LT s143 1) (LT s204 1) (LT s147 1) (LT s208 1) (LT s151 1) (LT s212 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2907 reset in 677 ms.
Stack based approach found an accepted trace after 5316 steps with 151 reset with depth 12 and stack size 12 in 35 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-01 finished in 1369 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((p1&&X(X(p2))))))||G(!p1)))'
Support contains 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 11 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:59:14] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 12:59:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 12:59:14] [INFO ] Invariant cache hit.
[2023-03-19 12:59:15] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-19 12:59:15] [INFO ] Invariant cache hit.
[2023-03-19 12:59:15] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 542 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}, { cond=p0, acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=2, aps=[p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5887 reset in 468 ms.
Product exploration explored 100000 steps with 5827 reset in 482 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 410 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 86 steps, including 0 resets, run visited all 11 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F p0), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 686 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 377 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
[2023-03-19 12:59:19] [INFO ] Invariant cache hit.
[2023-03-19 12:59:19] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-19 12:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:19] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-19 12:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:59:19] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-19 12:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:19] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-19 12:59:19] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-19 12:59:19] [INFO ] Added : 0 causal constraints over 0 iterations in 85 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-19 12:59:19] [INFO ] Invariant cache hit.
[2023-03-19 12:59:19] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-19 12:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:20] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-19 12:59:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:59:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-19 12:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:20] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-19 12:59:20] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-19 12:59:21] [INFO ] Added : 111 causal constraints over 23 iterations in 594 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 12:59:21] [INFO ] Invariant cache hit.
[2023-03-19 12:59:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 12:59:21] [INFO ] Invariant cache hit.
[2023-03-19 12:59:21] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-19 12:59:21] [INFO ] Invariant cache hit.
[2023-03-19 12:59:21] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 242 steps, including 0 resets, run visited all 11 properties in 8 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F p0), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 579 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
[2023-03-19 12:59:23] [INFO ] Invariant cache hit.
[2023-03-19 12:59:23] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-19 12:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:23] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-19 12:59:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:59:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-19 12:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:23] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-19 12:59:24] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-19 12:59:24] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-19 12:59:24] [INFO ] Invariant cache hit.
[2023-03-19 12:59:24] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 12:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:24] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-19 12:59:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:59:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 12:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-19 12:59:24] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-19 12:59:25] [INFO ] Added : 111 causal constraints over 23 iterations in 625 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5891 reset in 437 ms.
Product exploration explored 100000 steps with 5848 reset in 455 ms.
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 12:59:26] [INFO ] Invariant cache hit.
[2023-03-19 12:59:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-19 12:59:26] [INFO ] Invariant cache hit.
[2023-03-19 12:59:26] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-19 12:59:26] [INFO ] Invariant cache hit.
[2023-03-19 12:59:27] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 finished in 12514 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(G(!p0))))'
Support contains 160 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2023-03-19 12:59:27] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 12:59:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 12:59:27] [INFO ] Invariant cache hit.
[2023-03-19 12:59:27] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-19 12:59:27] [INFO ] Invariant cache hit.
[2023-03-19 12:59:27] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s131 1) (LT s192 1) (LT s135 1) (LT s196 1) (LT s139 1) (LT s200 1) (LT s143 1) (LT s204 1) (LT s147 1) (LT s208 1) (LT s151 1) (LT s212 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-04 finished in 728 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) U (!p1&&F(p1))))'
Support contains 55 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Applied a total of 440 rules in 29 ms. Remains 175 /375 variables (removed 200) and now considering 350/590 (removed 240) transitions.
// Phase 1: matrix 350 rows 175 cols
[2023-03-19 12:59:28] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 12:59:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 12:59:28] [INFO ] Invariant cache hit.
[2023-03-19 12:59:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-19 12:59:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 12:59:28] [INFO ] Invariant cache hit.
[2023-03-19 12:59:28] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/375 places, 350/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 175/375 places, 350/590 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s124 1) (GEQ s123 1) (GEQ s120 1) (GEQ s119 1) (GEQ s122 1) (GEQ s121 1) (GEQ s116 1) (GEQ s115 1) (GEQ s118 1) (GEQ s117 1)), p0:(OR (AND (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 284 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 (AND p1 (NOT p0))), (X p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (AND p1 (NOT p0)))
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-07 finished in 1170 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 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 212 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 212 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 182 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 182 transition count 240
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 467 place count 161 transition count 220
Applied a total of 467 rules in 22 ms. Remains 161 /375 variables (removed 214) and now considering 220/590 (removed 370) transitions.
// Phase 1: matrix 220 rows 161 cols
[2023-03-19 12:59:29] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 12:59:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 12:59:29] [INFO ] Invariant cache hit.
[2023-03-19 12:59:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-19 12:59:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:29] [INFO ] Invariant cache hit.
[2023-03-19 12:59:29] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/375 places, 220/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 161/375 places, 220/590 transitions.
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s98 1) (LT s143 1)) (OR (LT s118 1) (LT s148 1)) (OR (LT s108 1) (LT s145 1)) (OR (LT s93 1) (LT s141 1)) (OR (LT s123 1) (LT s149 1)) (OR...], 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 474 reset in 694 ms.
Stack based approach found an accepted trace after 18775 steps with 96 reset with depth 349 and stack size 349 in 134 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-08 finished in 1168 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(!p0)) U p1)))'
Support contains 180 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2023-03-19 12:59:30] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 12:59:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-19 12:59:30] [INFO ] Invariant cache hit.
[2023-03-19 12:59:30] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-19 12:59:30] [INFO ] Invariant cache hit.
[2023-03-19 12:59:30] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s294 1) (GEQ s295 1) (GEQ s300 1) (GEQ s301 1) (GEQ s302 1) (GEQ s303 1) (GEQ s296 1) (GEQ s297 1) (GEQ s298 1) (GEQ s299 1)), p0:(OR (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 382 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) p0), (X p1), (X (NOT (AND (NOT p1) p0))), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-09 finished in 1666 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 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 212 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 212 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 182 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 182 transition count 240
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 487 place count 151 transition count 210
Applied a total of 487 rules in 28 ms. Remains 151 /375 variables (removed 224) and now considering 210/590 (removed 380) transitions.
// Phase 1: matrix 210 rows 151 cols
[2023-03-19 12:59:32] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 12:59:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 12:59:32] [INFO ] Invariant cache hit.
[2023-03-19 12:59:32] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-19 12:59:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 12:59:32] [INFO ] Invariant cache hit.
[2023-03-19 12:59:32] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 151/375 places, 210/590 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s94 1) (GEQ s142 1)) (AND (GEQ s114 1) (GEQ s147 1)) (AND (GEQ s119 1) (GEQ s148 1)) (AND (GEQ s118 1) (GEQ s148 1)) (AND (GEQ s98 1) (GE...], 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 377 ms.
Stack based approach found an accepted trace after 702 steps with 0 reset with depth 703 and stack size 703 in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-10 finished in 712 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(F(p0)))'
Support contains 45 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 460 place count 165 transition count 340
Applied a total of 460 rules in 22 ms. Remains 165 /375 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 165 cols
[2023-03-19 12:59:32] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 12:59:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 12:59:32] [INFO ] Invariant cache hit.
[2023-03-19 12:59:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-19 12:59:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:32] [INFO ] Invariant cache hit.
[2023-03-19 12:59:33] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/375 places, 340/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 165/375 places, 340/590 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s30 1) (LT s94 1)) (OR (LT s0 1) (LT s16 1) (LT s94 1)) (OR (LT s1 1) (LT s33 1) (LT s94 1)) (OR (LT s2 1) (LT s10 1) (LT s94 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7906 reset in 523 ms.
Product exploration explored 100000 steps with 7858 reset in 533 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 45 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 10 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2023-03-19 12:59:34] [INFO ] Invariant cache hit.
[2023-03-19 12:59:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 12:59:34] [INFO ] Invariant cache hit.
[2023-03-19 12:59:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-19 12:59:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:34] [INFO ] Invariant cache hit.
[2023-03-19 12:59:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 165/165 places, 340/340 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 124 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 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 137 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7912 reset in 523 ms.
Product exploration explored 100000 steps with 7931 reset in 531 ms.
Support contains 45 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 13 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2023-03-19 12:59:36] [INFO ] Invariant cache hit.
[2023-03-19 12:59:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 12:59:36] [INFO ] Invariant cache hit.
[2023-03-19 12:59:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-19 12:59:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:36] [INFO ] Invariant cache hit.
[2023-03-19 12:59:36] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 165/165 places, 340/340 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 finished in 4243 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&&X(G(!p1))))) U (X(X(!p2))||F(p0))))'
Support contains 180 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2023-03-19 12:59:36] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-19 12:59:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-19 12:59:37] [INFO ] Invariant cache hit.
[2023-03-19 12:59:37] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-19 12:59:37] [INFO ] Invariant cache hit.
[2023-03-19 12:59:37] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s294 1) (GEQ s295 1) (GEQ s300 1) (GEQ s301 1) (GEQ s302 1) (GEQ s303 1) (GEQ s296 1) (GEQ s297 1) (GEQ s298 1) (GEQ s299 1)), p2:(AND (LT s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-12 finished in 1846 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))'
Support contains 45 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 215 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 175 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 460 place count 165 transition count 340
Applied a total of 460 rules in 23 ms. Remains 165 /375 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 165 cols
[2023-03-19 12:59:38] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 12:59:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 12:59:38] [INFO ] Invariant cache hit.
[2023-03-19 12:59:39] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-19 12:59:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:39] [INFO ] Invariant cache hit.
[2023-03-19 12:59:39] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/375 places, 340/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 165/375 places, 340/590 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s30 1) (LT s94 1)) (OR (LT s0 1) (LT s16 1) (LT s94 1)) (OR (LT s1 1) (LT s33 1) (LT s94 1)) (OR (LT s2 1) (LT s10 1) (LT s94 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 44544 reset in 512 ms.
Product exploration explored 100000 steps with 44525 reset in 523 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 131 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 26 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
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 38 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
[2023-03-19 12:59:40] [INFO ] Invariant cache hit.
[2023-03-19 12:59:41] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-19 12:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:41] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-19 12:59:41] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-19 12:59:41] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG p0
Support contains 45 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 11 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2023-03-19 12:59:41] [INFO ] Invariant cache hit.
[2023-03-19 12:59:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 12:59:41] [INFO ] Invariant cache hit.
[2023-03-19 12:59:41] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-19 12:59:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:41] [INFO ] Invariant cache hit.
[2023-03-19 12:59:41] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 165/165 places, 340/340 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 106 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 33 ms :[p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 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 27 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
[2023-03-19 12:59:41] [INFO ] Invariant cache hit.
[2023-03-19 12:59:42] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-19 12:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:59:42] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-19 12:59:42] [INFO ] Computed and/alt/rep : 290/640/290 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-19 12:59:42] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 44547 reset in 515 ms.
Product exploration explored 100000 steps with 44545 reset in 521 ms.
Support contains 45 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 340/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2023-03-19 12:59:43] [INFO ] Invariant cache hit.
[2023-03-19 12:59:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 12:59:43] [INFO ] Invariant cache hit.
[2023-03-19 12:59:43] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-19 12:59:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:59:43] [INFO ] Invariant cache hit.
[2023-03-19 12:59:43] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 165/165 places, 340/340 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 finished in 5068 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(((p0 U p1)&&F(p2)))))'
Support contains 105 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 11 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:59:43] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-19 12:59:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 12:59:44] [INFO ] Invariant cache hit.
[2023-03-19 12:59:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 12:59:44] [INFO ] Invariant cache hit.
[2023-03-19 12:59:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (OR (AND (GEQ s2 1) (GEQ s40 1) (GEQ s184 1)) (AND (GEQ s0 1) (GEQ s26 1) (GEQ s184 1)) (AND (GEQ s1 1) (GEQ s43 1) (GEQ s184 1)) (AND (GEQ s2 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 43 reset in 1062 ms.
Product exploration explored 100000 steps with 46 reset in 1048 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-19 12:59:47] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLFireability-14 finished in 5762 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((p1&&X(X(p2))))))||G(!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' '!(G(F(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' '!(F(!p0))'
[2023-03-19 12:59:49] [INFO ] Flatten gal took : 43 ms
[2023-03-19 12:59:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2023-03-19 12:59:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 375 places, 590 transitions and 1720 arcs took 4 ms.
Total runtime 39617 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT UtilityControlRoom-COL-Z4T3N10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T3N10-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679230791628

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 9 (type EXCL) for 6 UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLFireability-13
lola: result : false
lola: markings : 1024
lola: fired transitions : 5120
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLFireability-11
lola: result : false
lola: markings : 47
lola: fired transitions : 47
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLFireability-02
lola: result : false
lola: markings : 114
lola: fired transitions : 115
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T3N10-LTLFireability-02: LTL false LTL model checker
UtilityControlRoom-COL-Z4T3N10-LTLFireability-11: LTL false LTL model checker
UtilityControlRoom-COL-Z4T3N10-LTLFireability-13: F true state space / EG


Time elapsed: 0 secs. Pages in use: 1

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-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is UtilityControlRoom-COL-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912703901044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T3N10.tgz
mv UtilityControlRoom-COL-Z4T3N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;