About the Execution of LoLa+red for UtilityControlRoom-COL-Z4T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1129.852 | 127508.00 | 148674.00 | 752.60 | ?FFFTFFFFTFFFF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r487-tall-167912703901043.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703901043
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679230611880
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=LTLCardinality
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:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 12:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:56:53] [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:56:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 12:56:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 390 ms
[2023-03-19 12:56:53] [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/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 12:56:53] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-19 12:56:53] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 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
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-19 12:56:54] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-19 12:56:54] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 12:56:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-19 12:56:54] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-19 12:56:54] [INFO ] Flatten gal took : 12 ms
[2023-03-19 12:56:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 12:56:54] [INFO ] Flatten gal took : 3 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:56:54] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 19 ms.
[2023-03-19 12:56:54] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 356 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 10 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:56:54] [INFO ] Computed 23 place invariants in 17 ms
[2023-03-19 12:56:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-19 12:56:54] [INFO ] Invariant cache hit.
[2023-03-19 12:56:54] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-19 12:56:54] [INFO ] Invariant cache hit.
[2023-03-19 12:56:55] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 356 out of 376 places after structural reductions.
[2023-03-19 12:56:55] [INFO ] Flatten gal took : 45 ms
[2023-03-19 12:56:55] [INFO ] Flatten gal took : 37 ms
[2023-03-19 12:56:55] [INFO ] Input system was already deterministic with 590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 12:56:55] [INFO ] Invariant cache hit.
[2023-03-19 12:56:55] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 12:56:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-19 12:56:55] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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' '!(((p0||F((G(F(p1))||(F(p1)&&G(p0))))) U G((p2 U !p1))))'
Support contains 94 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 260 place count 246 transition count 460
Applied a total of 260 rules in 72 ms. Remains 246 /376 variables (removed 130) and now considering 460/590 (removed 130) transitions.
// Phase 1: matrix 460 rows 246 cols
[2023-03-19 12:56:55] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-19 12:56:55] [INFO ] Implicit Places using invariants in 99 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/376 places, 460/590 transitions.
Applied a total of 0 rules in 13 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 245/376 places, 460/590 transitions.
Stuttering acceptance computed with spot in 383 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183) (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 30630 reset in 648 ms.
Product exploration explored 100000 steps with 31173 reset in 683 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) p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge based reduction with 19 factoid took 1007 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 7 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 460 rows 245 cols
[2023-03-19 12:56:59] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-19 12:56:59] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 12:56:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 12:56:59] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (AND p0 p1 p2)), (F (AND p1 p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F p0), (F p1), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 20 factoid took 1199 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 94 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-19 12:57:01] [INFO ] Invariant cache hit.
[2023-03-19 12:57:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 12:57:01] [INFO ] Invariant cache hit.
[2023-03-19 12:57:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-19 12:57:01] [INFO ] Invariant cache hit.
[2023-03-19 12:57:01] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 245/245 places, 460/460 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND p1 p2)), (X (AND (NOT p0) p1)), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 12 factoid took 650 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 175 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND p1 p2)), (X (AND (NOT p0) p1)), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p1), (F (AND p1 p2)), (F (AND p0 p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 767 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 243 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31283 reset in 417 ms.
Product exploration explored 100000 steps with 30629 reset in 449 ms.
Applying partial POR strategy [false, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 275 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 94 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 18 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-19 12:57:05] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 12:57:05] [INFO ] Invariant cache hit.
[2023-03-19 12:57:05] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 245/245 places, 460/460 transitions.
Support contains 94 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-19 12:57:05] [INFO ] Invariant cache hit.
[2023-03-19 12:57:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 12:57:05] [INFO ] Invariant cache hit.
[2023-03-19 12:57:05] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-19 12:57:05] [INFO ] Invariant cache hit.
[2023-03-19 12:57:05] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 245/245 places, 460/460 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 finished in 10125 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)||G(p1))))'
Support contains 45 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 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 376 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 216 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 216 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 176 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 166 transition count 340
Applied a total of 460 rules in 38 ms. Remains 166 /376 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 166 cols
[2023-03-19 12:57:05] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 12:57:05] [INFO ] Invariant cache hit.
[2023-03-19 12:57:06] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-19 12:57:06] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 12:57:06] [INFO ] Invariant cache hit.
[2023-03-19 12:57:06] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/376 places, 340/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 166/376 places, 340/590 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s105 (ADD s0 s1 s2 s3)), p1:(GT 1 (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40...], nbAcceptance=2, 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 459 ms.
Stack based approach found an accepted trace after 38011 steps with 0 reset with depth 38012 and stack size 24575 in 193 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-01 finished in 1046 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(F(p1))))))'
Support contains 61 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:06] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:07] [INFO ] Implicit Places using invariants in 89 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT (ADD s195 s196 s197 s198 s199 s200 s201 s202 s203 s204) s184), p0:(GT (ADD s185 s186 s187 s188 s189 s190 s191 s192 s193 s194) (ADD s134 s135 s136 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2321 reset in 359 ms.
Product exploration explored 100000 steps with 2343 reset in 347 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 41 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:57:08] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-19 12:57:08] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-19 12:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:08] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-19 12:57:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 12:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:09] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-19 12:57:09] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-19 12:57:11] [INFO ] Added : 416 causal constraints over 84 iterations in 2299 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 12:57:11] [INFO ] Invariant cache hit.
[2023-03-19 12:57:11] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-02 finished in 4866 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||G(F(p1))))))'
Support contains 54 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:11] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-19 12:57:11] [INFO ] Implicit Places using invariants in 107 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183) (ADD s0 s1 s2 s3)), p1:(LEQ 2 (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3490 reset in 276 ms.
Product exploration explored 100000 steps with 3410 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 106 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:57:13] [INFO ] Computed 22 place invariants in 7 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-03 finished in 1562 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((X(p0)||(p0&&G(p1))))))'
Support contains 85 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:13] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-19 12:57:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 12:57:13] [INFO ] Invariant cache hit.
[2023-03-19 12:57:13] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-19 12:57:13] [INFO ] Invariant cache hit.
[2023-03-19 12:57:13] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4046 reset in 318 ms.
Product exploration explored 100000 steps with 4084 reset in 322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 12:57:15] [INFO ] Invariant cache hit.
[2023-03-19 12:57:15] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-19 12:57:15] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-19 12:57:15] [INFO ] Invariant cache hit.
[2023-03-19 12:57:15] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-19 12:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:15] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-19 12:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-19 12:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-19 12:57:16] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 25 ms.
[2023-03-19 12:57:16] [INFO ] Added : 128 causal constraints over 26 iterations in 630 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 44 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 12:57:16] [INFO ] Invariant cache hit.
[2023-03-19 12:57:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 12:57:17] [INFO ] Invariant cache hit.
[2023-03-19 12:57:17] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 12:57:17] [INFO ] Invariant cache hit.
[2023-03-19 12:57:17] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 256/256 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 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 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-19 12:57:17] [INFO ] Invariant cache hit.
[2023-03-19 12:57:17] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-19 12:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:18] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-19 12:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-19 12:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:18] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-19 12:57:18] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 25 ms.
[2023-03-19 12:57:19] [INFO ] Added : 128 causal constraints over 26 iterations in 625 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4059 reset in 310 ms.
Product exploration explored 100000 steps with 4077 reset in 322 ms.
Support contains 44 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
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 120 place count 196 transition count 410
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 160 place count 196 transition count 370
Applied a total of 160 rules in 12 ms. Remains 196 /256 variables (removed 60) and now considering 370/470 (removed 100) transitions.
// Phase 1: matrix 370 rows 196 cols
[2023-03-19 12:57:19] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:19] [INFO ] Implicit Places using invariants in 82 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/256 places, 370/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 195/256 places, 370/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05 finished in 6554 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 80 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 280 place count 236 transition count 450
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 320 place count 236 transition count 410
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 323 place count 233 transition count 290
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 327 place count 232 transition count 290
Applied a total of 327 rules in 25 ms. Remains 232 /376 variables (removed 144) and now considering 290/590 (removed 300) transitions.
// Phase 1: matrix 290 rows 232 cols
[2023-03-19 12:57:19] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-19 12:57:20] [INFO ] Implicit Places using invariants in 91 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/376 places, 290/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 231/376 places, 290/590 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-07 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:(GT (ADD s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s2...], 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 3241 reset in 294 ms.
Stack based approach found an accepted trace after 59712 steps with 1940 reset with depth 37 and stack size 37 in 177 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-07 finished in 665 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))&&F((p1||X(p2))))))'
Support contains 55 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 14 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:20] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-19 12:57:20] [INFO ] Implicit Places using invariants in 84 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GT 3 (ADD s0 s1 s2 s3)), p1:(GT (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-08 finished in 270 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 44 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 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 376 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 216 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 400 place count 196 transition count 370
Applied a total of 400 rules in 30 ms. Remains 196 /376 variables (removed 180) and now considering 370/590 (removed 220) transitions.
// Phase 1: matrix 370 rows 196 cols
[2023-03-19 12:57:20] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-19 12:57:20] [INFO ] Implicit Places using invariants in 86 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/376 places, 370/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 195/376 places, 370/590 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-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:(LEQ (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s1...], 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 392 ms.
Stack based approach found an accepted trace after 8565 steps with 0 reset with depth 8566 and stack size 8566 in 37 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-10 finished in 792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 50 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 6 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:21] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-19 12:57:21] [INFO ] Implicit Places using invariants in 104 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183) (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-11 finished in 214 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(p0)||X(p1)))'
Support contains 51 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-19 12:57:21] [INFO ] Invariant cache hit.
[2023-03-19 12:57:21] [INFO ] Implicit Places using invariants in 88 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s184 (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-12 finished in 261 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&&(p1 U !p0)))))'
Support contains 51 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-19 12:57:22] [INFO ] Invariant cache hit.
[2023-03-19 12:57:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 12:57:22] [INFO ] Invariant cache hit.
[2023-03-19 12:57:22] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-19 12:57:22] [INFO ] Invariant cache hit.
[2023-03-19 12:57:22] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 114 ms :[p0, true, true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s185), p1:(GT (ADD s186 s187 s188 s189 s190 s191 s192 s193 s194 s195) (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 ...], 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, true, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 12:57:23] [INFO ] Invariant cache hit.
[2023-03-19 12:57:23] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 12:57:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-19 12:57:24] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 12:57:24] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 12:57:24] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 45 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[p0, true, true]
Stuttering acceptance computed with spot in 102 ms :[p0, true, true]
[2023-03-19 12:57:24] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), true]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, true, true]
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 4 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 12:57:25] [INFO ] Invariant cache hit.
[2023-03-19 12:57:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 12:57:25] [INFO ] Invariant cache hit.
[2023-03-19 12:57:25] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-19 12:57:25] [INFO ] Invariant cache hit.
[2023-03-19 12:57:25] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 256/256 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 p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, true, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :1
Finished Best-First random walk after 5270 steps, including 1 resets, run visited all 2 properties in 12 ms. (steps per millisecond=439 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, true, true]
Stuttering acceptance computed with spot in 83 ms :[p0, true, true]
[2023-03-19 12:57:26] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), true]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, true, true]
Stuttering acceptance computed with spot in 107 ms :[p0, true, true]
Product exploration explored 100000 steps with 0 reset in 298 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[p0, true, true]
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 256 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 90 place count 256 transition count 460
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 253 transition count 340
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 253 transition count 340
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 126 place count 223 transition count 310
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 156 place count 223 transition count 310
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 156 rules in 29 ms. Remains 223 /256 variables (removed 33) and now considering 310/470 (removed 160) transitions.
[2023-03-19 12:57:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 310 rows 223 cols
[2023-03-19 12:57:28] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:28] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/256 places, 310/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 223/256 places, 310/470 transitions.
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-19 12:57:28] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:28] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 12:57:28] [INFO ] Invariant cache hit.
[2023-03-19 12:57:28] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-19 12:57:28] [INFO ] Invariant cache hit.
[2023-03-19 12:57:28] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 256/256 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13 finished in 6674 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(X(F(p0)))))'
Support contains 10 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-19 12:57:28] [INFO ] Invariant cache hit.
[2023-03-19 12:57:28] [INFO ] Implicit Places using invariants in 111 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s185 s186 s187 s188 s189 s190 s191 s192 s193 s194))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2793 reset in 227 ms.
Product exploration explored 100000 steps with 2781 reset in 233 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:57:30] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-19 12:57:30] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-19 12:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:30] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-19 12:57:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-19 12:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:30] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-19 12:57:30] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-19 12:57:31] [INFO ] Added : 196 causal constraints over 40 iterations in 988 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 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 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-19 12:57:31] [INFO ] Invariant cache hit.
[2023-03-19 12:57:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-19 12:57:31] [INFO ] Invariant cache hit.
[2023-03-19 12:57:31] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-19 12:57:31] [INFO ] Invariant cache hit.
[2023-03-19 12:57:32] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 12:57:32] [INFO ] Invariant cache hit.
[2023-03-19 12:57:32] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2023-03-19 12:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:32] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-19 12:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-19 12:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:33] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-19 12:57:33] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-19 12:57:35] [INFO ] Added : 372 causal constraints over 75 iterations in 1954 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2795 reset in 232 ms.
Product exploration explored 100000 steps with 2799 reset in 233 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 90 place count 255 transition count 540
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 130 place count 255 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 252 transition count 380
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 252 transition count 380
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 166 place count 222 transition count 350
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 196 place count 222 transition count 350
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 256 place count 162 transition count 230
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 316 place count 162 transition count 230
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 376 place count 102 transition count 170
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 436 place count 102 transition count 170
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 496 place count 102 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 496 rules in 26 ms. Remains 102 /255 variables (removed 153) and now considering 110/470 (removed 360) transitions.
[2023-03-19 12:57:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 102 cols
[2023-03-19 12:57:36] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-19 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/255 places, 110/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 102/255 places, 110/470 transitions.
Support contains 10 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.
// Phase 1: matrix 470 rows 255 cols
[2023-03-19 12:57:36] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-19 12:57:36] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 12:57:36] [INFO ] Invariant cache hit.
[2023-03-19 12:57:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-19 12:57:36] [INFO ] Invariant cache hit.
[2023-03-19 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 255/255 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 finished in 7849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F((G(F(p1))||(F(p1)&&G(p0))))) U G((p2 U !p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p0&&G(p1))))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 85 out of 376 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 280 place count 236 transition count 450
Applied a total of 280 rules in 19 ms. Remains 236 /376 variables (removed 140) and now considering 450/590 (removed 140) transitions.
// Phase 1: matrix 450 rows 236 cols
[2023-03-19 12:57:36] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-19 12:57:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 12:57:37] [INFO ] Invariant cache hit.
[2023-03-19 12:57:37] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-19 12:57:37] [INFO ] Invariant cache hit.
[2023-03-19 12:57:37] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 236/376 places, 450/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 410 ms. Remains : 236/376 places, 450/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4986 reset in 381 ms.
Product exploration explored 100000 steps with 5004 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 12:57:38] [INFO ] Invariant cache hit.
[2023-03-19 12:57:39] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-19 12:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-19 12:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-19 12:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:39] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-19 12:57:39] [INFO ] Computed and/alt/rep : 370/760/370 causal constraints (skipped 40 transitions) in 21 ms.
[2023-03-19 12:57:40] [INFO ] Added : 274 causal constraints over 55 iterations in 1310 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 44 out of 236 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 450/450 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-19 12:57:40] [INFO ] Invariant cache hit.
[2023-03-19 12:57:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 12:57:40] [INFO ] Invariant cache hit.
[2023-03-19 12:57:41] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-19 12:57:41] [INFO ] Invariant cache hit.
[2023-03-19 12:57:41] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 236/236 places, 450/450 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 12:57:41] [INFO ] Invariant cache hit.
[2023-03-19 12:57:41] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-19 12:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:42] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-19 12:57:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-19 12:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:42] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-19 12:57:42] [INFO ] Computed and/alt/rep : 370/760/370 causal constraints (skipped 40 transitions) in 20 ms.
[2023-03-19 12:57:43] [INFO ] Added : 274 causal constraints over 55 iterations in 1270 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4959 reset in 398 ms.
Product exploration explored 100000 steps with 4986 reset in 393 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 44 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 450/450 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 236 transition count 450
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 80 place count 236 transition count 410
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 80 rules in 16 ms. Remains 236 /236 variables (removed 0) and now considering 410/450 (removed 40) transitions.
[2023-03-19 12:57:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 410 rows 236 cols
[2023-03-19 12:57:44] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:44] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/236 places, 410/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 236/236 places, 410/450 transitions.
Support contains 44 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 450/450 transitions.
Applied a total of 0 rules in 1 ms. Remains 236 /236 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 236 cols
[2023-03-19 12:57:44] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-19 12:57:44] [INFO ] Implicit Places using invariants in 88 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/236 places, 450/450 transitions.
Applied a total of 0 rules in 2 ms. Remains 235 /235 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 235/236 places, 450/450 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05 finished in 8309 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&&(p1 U !p0)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13
Stuttering acceptance computed with spot in 86 ms :[p0, true, true]
Support contains 51 out of 376 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 376/376 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 376 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 216 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 213 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 213 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 183 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 183 transition count 240
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 446 place count 173 transition count 230
Applied a total of 446 rules in 24 ms. Remains 173 /376 variables (removed 203) and now considering 230/590 (removed 360) transitions.
// Phase 1: matrix 230 rows 173 cols
[2023-03-19 12:57:45] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-19 12:57:45] [INFO ] Implicit Places using invariants in 58 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 172/376 places, 230/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 85 ms. Remains : 172/376 places, 230/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s131), p1:(GT (ADD s132 s133 s134 s135 s136 s137 s138 s139 s140 s141) (ADD s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 8431 steps with 0 reset with depth 8432 and stack size 8045 in 18 ms.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13 finished in 435 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 376 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 376/376 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 376 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 216 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 216 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 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 73 transition count 70
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 3 with 20 rules applied. Total rules applied 696 place count 63 transition count 60
Applied a total of 696 rules in 21 ms. Remains 63 /376 variables (removed 313) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-19 12:57:45] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-19 12:57:45] [INFO ] Implicit Places using invariants in 43 ms returned [0, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 61/376 places, 60/590 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 66 ms. Remains : 61/376 places, 60/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7831 reset in 147 ms.
Product exploration explored 100000 steps with 7839 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 60 rows 61 cols
[2023-03-19 12:57:46] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 12:57:46] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 12:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:46] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-19 12:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 12:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-19 12:57:46] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 12:57:46] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:57:46] [INFO ] Invariant cache hit.
[2023-03-19 12:57:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 12:57:46] [INFO ] Invariant cache hit.
[2023-03-19 12:57:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 12:57:46] [INFO ] Invariant cache hit.
[2023-03-19 12:57:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 61/61 places, 60/60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 12:57:47] [INFO ] Invariant cache hit.
[2023-03-19 12:57:47] [INFO ] [Real]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-03-19 12:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-19 12:57:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:57:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 12:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:57:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-19 12:57:47] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 12:57:47] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7832 reset in 151 ms.
Product exploration explored 100000 steps with 7818 reset in 160 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:57:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 12:57:48] [INFO ] Invariant cache hit.
[2023-03-19 12:57:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 61/61 places, 60/60 transitions.
Support contains 10 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:57:48] [INFO ] Invariant cache hit.
[2023-03-19 12:57:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 12:57:48] [INFO ] Invariant cache hit.
[2023-03-19 12:57:48] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 12:57:48] [INFO ] Invariant cache hit.
[2023-03-19 12:57:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 61/61 places, 60/60 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 finished in 2933 ms.
[2023-03-19 12:57:48] [INFO ] Flatten gal took : 29 ms
[2023-03-19 12:57:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 12:57:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 376 places, 590 transitions and 1770 arcs took 5 ms.
Total runtime 55187 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT UtilityControlRoom-COL-Z4T3N10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679230739388
--------------------
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 LTLCardinality -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/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 5/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 608737 m, 121747 m/sec, 979234 t fired, .
Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 9/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 1154945 m, 109241 m/sec, 1892234 t fired, .
Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 13/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 1716949 m, 112400 m/sec, 2833069 t fired, .
Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/900 17/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 2285088 m, 113627 m/sec, 3779933 t fired, .
Time elapsed: 20 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/900 21/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 2858937 m, 114769 m/sec, 4754742 t fired, .
Time elapsed: 25 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/900 26/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 3437329 m, 115678 m/sec, 5722767 t fired, .
Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/900 30/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 4016125 m, 115759 m/sec, 6698629 t fired, .
Time elapsed: 35 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14
lola: time limit : 1186 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1186 7/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 855008 m, 171001 m/sec, 1930279 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1186 13/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 1642047 m, 157407 m/sec, 3803905 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1186 18/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 2441742 m, 159939 m/sec, 5662016 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1186 23/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 3081576 m, 127966 m/sec, 7665073 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1186 28/32 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 3792036 m, 142092 m/sec, 9649274 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13
lola: time limit : 1765 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13
lola: result : false
lola: markings : 10
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05
lola: time limit : 3530 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05
lola: result : false
lola: markings : 11
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-00: LTL unknown AGGR
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-05: LTL false LTL model checker
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-13: LTL false LTL model checker
UtilityControlRoom-COL-Z4T3N10-LTLCardinality-14: LTL unknown AGGR
Time elapsed: 70 secs. Pages in use: 32
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="LTLCardinality"
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 LTLCardinality"
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-167912703901043"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;