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-167912703901075.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-Z4T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703901075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.2K Feb 26 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 14:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 14:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 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-Z4T4N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679231646967

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-Z4T4N08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 13:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:14:08] [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 13:14:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 13:14:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 405 ms
[2023-03-19 13:14:08] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 13:14:09] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-19 13:14:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 167 steps, including 0 resets, run visited all 27 properties in 13 ms. (steps per millisecond=12 )
[2023-03-19 13:14:09] [INFO ] Flatten gal took : 14 ms
[2023-03-19 13:14:09] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-19 13:14:09] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 20 ms.
[2023-03-19 13:14:09] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 294 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-19 13:14:09] [INFO ] Computed 19 place invariants in 27 ms
[2023-03-19 13:14:09] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-19 13:14:09] [INFO ] Invariant cache hit.
[2023-03-19 13:14:09] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-19 13:14:09] [INFO ] Invariant cache hit.
[2023-03-19 13:14:10] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2023-03-19 13:14:10] [INFO ] Flatten gal took : 38 ms
[2023-03-19 13:14:10] [INFO ] Flatten gal took : 34 ms
[2023-03-19 13:14:10] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 191 steps, including 0 resets, run visited all 26 properties in 13 ms. (steps per millisecond=14 )
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&G(p1)))) U G(p2)))'
Support contains 81 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 40 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-19 13:14:10] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-19 13:14:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-19 13:14:10] [INFO ] Invariant cache hit.
[2023-03-19 13:14:11] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-19 13:14:11] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 13:14:11] [INFO ] Invariant cache hit.
[2023-03-19 13:14:11] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s149), p0:(GT (ADD s12 s13 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 s42 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 458 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F p2), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-19 13:14:13] [INFO ] Invariant cache hit.
[2023-03-19 13:14:13] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-19 13:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 13:14:13] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-19 13:14:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 13:14:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-19 13:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 13:14:13] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-19 13:14:13] [INFO ] Computed and/alt/rep : 336/552/336 causal constraints (skipped 32 transitions) in 23 ms.
[2023-03-19 13:14:14] [INFO ] Added : 38 causal constraints over 8 iterations in 306 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 81 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 376/376 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-19 13:14:14] [INFO ] Invariant cache hit.
[2023-03-19 13:14:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 13:14:14] [INFO ] Invariant cache hit.
[2023-03-19 13:14:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-19 13:14:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 13:14:14] [INFO ] Invariant cache hit.
[2023-03-19 13:14:14] [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 429 ms. Remains : 206/206 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 35 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F p2), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-19 13:14:15] [INFO ] Invariant cache hit.
[2023-03-19 13:14:15] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-19 13:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 13:14:16] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-19 13:14:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 13:14:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-19 13:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 13:14:16] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-19 13:14:16] [INFO ] Computed and/alt/rep : 336/552/336 causal constraints (skipped 32 transitions) in 19 ms.
[2023-03-19 13:14:16] [INFO ] Added : 38 causal constraints over 8 iterations in 175 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 364 ms.
Product exploration explored 100000 steps with 0 reset in 300 ms.
Support contains 81 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-19 13:14:17] [INFO ] Invariant cache hit.
[2023-03-19 13:14:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 13:14:17] [INFO ] Invariant cache hit.
[2023-03-19 13:14:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 13:14:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:14:17] [INFO ] Invariant cache hit.
[2023-03-19 13:14:17] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 206/206 places, 376/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01 finished in 7050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 72 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 10 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-19 13:14:17] [INFO ] Invariant cache hit.
[2023-03-19 13:14:17] [INFO ] Implicit Places using invariants in 225 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 (ADD s12 s13 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 s42 s43)) (LEQ ...], 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 50000 reset in 318 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-02 finished in 1138 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(F(!((p0 U p1) U X(p0))))))'
Support contains 64 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 13 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-19 13:14:18] [INFO ] Invariant cache hit.
[2023-03-19 13:14:18] [INFO ] Implicit Places using invariants in 80 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, false, p0, false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19958 reset in 358 ms.
Product exploration explored 100000 steps with 20040 reset in 365 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 (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p0, false, p0, false]
Finished random walk after 33 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 522 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, false, p0, false]
Stuttering acceptance computed with spot in 140 ms :[p0, false, p0, false]
// Phase 1: matrix 376 rows 205 cols
[2023-03-19 13:14:21] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-19 13:14:21] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned unsat
Proved EG p0
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 8 factoid took 176 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-03 finished in 2650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1))) U (p2||F(G(p2)))))'
Support contains 14 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 15 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-19 13:14:21] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-19 13:14:21] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 13:14:21] [INFO ] Invariant cache hit.
[2023-03-19 13:14:21] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-19 13:14:21] [INFO ] Invariant cache hit.
[2023-03-19 13:14:21] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=p2, acceptance={1} source=3 dest: 3}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s149), p0:(LEQ (ADD s140 s141 s142 s143 s144 s145 s146 s147) s148), p1:(LEQ 2 (ADD s0 s1 s2 s3))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 768 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:14:23] [INFO ] Invariant cache hit.
[2023-03-19 13:14:23] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-19 13:14:23] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 13:14:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-19 13:14:23] [INFO ] After 37ms 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 p2) p0 p1), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND (NOT p2) p0 p1))), (F (AND p2 p0 p1)), (F p2), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1082 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-19 13:14:25] [INFO ] Invariant cache hit.
[2023-03-19 13:14:25] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND (NOT p2) p0 p1))), (F (AND p2 p0 p1)), (F p2), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 p0 (NOT p1))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 20 factoid took 562 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-04 finished in 4384 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)&&F(p1))))'
Support contains 176 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 294 transition count 464
Applied a total of 16 rules in 31 ms. Remains 294 /302 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 294 cols
[2023-03-19 13:14:25] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-19 13:14:26] [INFO ] Implicit Places using invariants in 131 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/302 places, 464/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 293/302 places, 464/472 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s245 s246 s247 s248 s249 s250 s251 s252)), p1:(OR (GT 3 (ADD s237 s238 s239 s240 s241 s242 s243 s244)) (GT 1 (ADD s245 s246 s247 s248 s249 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4790 reset in 293 ms.
Product exploration explored 100000 steps with 4793 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 341 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 176 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 464/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 293 cols
[2023-03-19 13:14:27] [INFO ] Computed 18 place invariants in 9 ms
[2023-03-19 13:14:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 13:14:27] [INFO ] Invariant cache hit.
[2023-03-19 13:14:27] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-19 13:14:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:14:27] [INFO ] Invariant cache hit.
[2023-03-19 13:14:28] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 293/293 places, 464/464 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4801 reset in 287 ms.
Product exploration explored 100000 steps with 4798 reset in 305 ms.
Support contains 176 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 464/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-19 13:14:29] [INFO ] Invariant cache hit.
[2023-03-19 13:14:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 13:14:29] [INFO ] Invariant cache hit.
[2023-03-19 13:14:29] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-19 13:14:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:14:29] [INFO ] Invariant cache hit.
[2023-03-19 13:14:29] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 293/293 places, 464/464 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05 finished in 4101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 384 place count 126 transition count 264
Applied a total of 384 rules in 43 ms. Remains 126 /302 variables (removed 176) and now considering 264/472 (removed 208) transitions.
// Phase 1: matrix 264 rows 126 cols
[2023-03-19 13:14:29] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 13:14:30] [INFO ] Implicit Places using invariants in 145 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/302 places, 264/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 124/302 places, 264/472 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8429 reset in 274 ms.
Product exploration explored 100000 steps with 8379 reset in 283 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 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 29 ms :[p0]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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 24 ms :[p0]
Stuttering acceptance computed with spot in 23 ms :[p0]
// Phase 1: matrix 264 rows 124 cols
[2023-03-19 13:14:31] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-19 13:14:31] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-10 finished in 1336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 374 place count 131 transition count 176
Applied a total of 374 rules in 22 ms. Remains 131 /302 variables (removed 171) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 131 cols
[2023-03-19 13:14:31] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 13:14:31] [INFO ] Implicit Places using invariants in 71 ms returned [0, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/302 places, 176/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 129/302 places, 176/472 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD 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 s123 s124 s125 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5525 reset in 238 ms.
Stack based approach found an accepted trace after 99445 steps with 5521 reset with depth 11 and stack size 11 in 239 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11 finished in 615 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((G((F(p0) U (p1||X(p2))))||X(p3))))'
Support contains 38 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 9 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-19 13:14:31] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 13:14:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 13:14:31] [INFO ] Invariant cache hit.
[2023-03-19 13:14:32] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-19 13:14:32] [INFO ] Invariant cache hit.
[2023-03-19 13:14:32] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3) s148), p0:(AND (LEQ 2 s149) (LEQ 1 (ADD s0 s1 s2 s3))), p2:(LEQ (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33547 reset in 254 ms.
Product exploration explored 100000 steps with 33284 reset in 264 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 521 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 13:14:34] [INFO ] Invariant cache hit.
[2023-03-19 13:14:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 13:14:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-19 13:14:34] [INFO ] After 42ms 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.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 795 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Support contains 38 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 376/376 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-19 13:14:35] [INFO ] Invariant cache hit.
[2023-03-19 13:14:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 13:14:35] [INFO ] Invariant cache hit.
[2023-03-19 13:14:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 13:14:35] [INFO ] Invariant cache hit.
[2023-03-19 13:14:35] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 206/206 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 576 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :7
Finished Best-First random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3))]
Knowledge based reduction with 11 factoid took 689 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 839 reset in 340 ms.
Product exploration explored 100000 steps with 816 reset in 352 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Support contains 38 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 376/376 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 206 transition count 400
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 16 ms. Remains 206 /206 variables (removed 0) and now considering 400/376 (removed -24) transitions.
[2023-03-19 13:14:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 206 cols
[2023-03-19 13:14:38] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 13:14:39] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 206/206 places, 400/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 206/206 places, 400/376 transitions.
Support contains 38 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-19 13:14:39] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 13:14:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 13:14:39] [INFO ] Invariant cache hit.
[2023-03-19 13:14:39] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-19 13:14:39] [INFO ] Invariant cache hit.
[2023-03-19 13:14:39] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 206/206 places, 376/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 finished in 7638 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))&&(p1||(F(p2)&&X(!p2))))))'
Support contains 37 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 7 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-19 13:14:39] [INFO ] Invariant cache hit.
[2023-03-19 13:14:39] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 13:14:39] [INFO ] Invariant cache hit.
[2023-03-19 13:14:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-19 13:14:39] [INFO ] Invariant cache hit.
[2023-03-19 13:14:39] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND p2 p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s149 (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13 finished in 548 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)&&F(G(p1)))))'
Support contains 129 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 302 transition count 440
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 270 transition count 440
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 262 transition count 432
Applied a total of 80 rules in 17 ms. Remains 262 /302 variables (removed 40) and now considering 432/472 (removed 40) transitions.
// Phase 1: matrix 432 rows 262 cols
[2023-03-19 13:14:40] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-19 13:14:40] [INFO ] Implicit Places using invariants in 104 ms returned [205]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/302 places, 432/472 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 229 transition count 400
Applied a total of 64 rules in 8 ms. Remains 229 /261 variables (removed 32) and now considering 400/432 (removed 32) transitions.
// Phase 1: matrix 400 rows 229 cols
[2023-03-19 13:14:40] [INFO ] Computed 18 place invariants in 6 ms
[2023-03-19 13:14:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 13:14:40] [INFO ] Invariant cache hit.
[2023-03-19 13:14:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/302 places, 400/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 229/302 places, 400/472 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 294 ms.
Stack based approach found an accepted trace after 12156 steps with 2 reset with depth 12110 and stack size 12110 in 41 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&G(p1)))) U G(p2)))'
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)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0) U (p1||X(p2))))||X(p3))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Support contains 38 out of 302 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 198 transition count 368
Applied a total of 208 rules in 14 ms. Remains 198 /302 variables (removed 104) and now considering 368/472 (removed 104) transitions.
// Phase 1: matrix 368 rows 198 cols
[2023-03-19 13:14:41] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 13:14:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 13:14:41] [INFO ] Invariant cache hit.
[2023-03-19 13:14:41] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-19 13:14:41] [INFO ] Invariant cache hit.
[2023-03-19 13:14:41] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 198/302 places, 368/472 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 337 ms. Remains : 198/302 places, 368/472 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3) s140), p0:(AND (LEQ 2 s141) (LEQ 1 (ADD s0 s1 s2 s3))), p2:(LEQ (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33415 reset in 321 ms.
Product exploration explored 100000 steps with 33458 reset in 334 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 566 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 13:14:43] [INFO ] Invariant cache hit.
[2023-03-19 13:14:43] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 13:14:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-19 13:14:43] [INFO ] After 50ms 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.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 831 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Support contains 38 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 368/368 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-19 13:14:44] [INFO ] Invariant cache hit.
[2023-03-19 13:14:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 13:14:45] [INFO ] Invariant cache hit.
[2023-03-19 13:14:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-19 13:14:45] [INFO ] Invariant cache hit.
[2023-03-19 13:14:45] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 198/198 places, 368/368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 489 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :7
Finished Best-First random walk after 219 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=219 )
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3))]
Knowledge based reduction with 11 factoid took 670 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 1018 reset in 356 ms.
Product exploration explored 100000 steps with 1035 reset in 362 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Support contains 38 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 368/368 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-19 13:14:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:14:48] [INFO ] Invariant cache hit.
[2023-03-19 13:14:48] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 198/198 places, 368/368 transitions.
Support contains 38 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 368/368 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-19 13:14:48] [INFO ] Invariant cache hit.
[2023-03-19 13:14:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 13:14:48] [INFO ] Invariant cache hit.
[2023-03-19 13:14:48] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 13:14:48] [INFO ] Invariant cache hit.
[2023-03-19 13:14:48] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 198/198 places, 368/368 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 finished in 7800 ms.
[2023-03-19 13:14:49] [INFO ] Flatten gal took : 31 ms
[2023-03-19 13:14:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 13:14:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 4 ms.
Total runtime 40713 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT UtilityControlRoom-COL-Z4T4N08
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679231715109

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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 # 6 (type EXCL) for 3 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05
lola: result : false
lola: markings : 170
lola: fired transitions : 196
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1800 7/32 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 891382 m, 178276 m/sec, 2150991 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1800 14/32 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 1731740 m, 168071 m/sec, 4245717 t fired, .

Time elapsed: 10 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1800 20/32 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 2580208 m, 169693 m/sec, 6376493 t fired, .

Time elapsed: 15 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1800 27/32 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 3477178 m, 179394 m/sec, 8592523 t fired, .

Time elapsed: 20 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01
lola: time limit : 3575 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01
lola: result : false
lola: markings : 18
lola: fired transitions : 18
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01: LTL false LTL model checker
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05: CONJ false LTL model checker
UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 25 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-Z4T4N08"
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-Z4T4N08, 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-167912703901075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N08.tgz
mv UtilityControlRoom-COL-Z4T4N08 execution
cd execution
if [ "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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;