Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707701075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is UtilityControlRoom-COL-Z4T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707701075
=====================================================================

--------------------
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 1679337855940

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:44:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:44:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 18:44:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:44:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 619 ms
[2023-03-20 18:44:18] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:44:18] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2023-03-20 18:44:18] [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 675 steps, including 0 resets, run visited all 27 properties in 21 ms. (steps per millisecond=32 )
[2023-03-20 18:44:18] [INFO ] Flatten gal took : 15 ms
[2023-03-20 18:44:18] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 18:44:18] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 21 ms.
[2023-03-20 18:44:18] [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-20 18:44:18] [INFO ] Computed 19 place invariants in 29 ms
[2023-03-20 18:44:18] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-20 18:44:18] [INFO ] Invariant cache hit.
[2023-03-20 18:44:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-20 18:44:18] [INFO ] Invariant cache hit.
[2023-03-20 18:44:19] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2023-03-20 18:44:19] [INFO ] Flatten gal took : 43 ms
[2023-03-20 18:44:19] [INFO ] Flatten gal took : 31 ms
[2023-03-20 18:44:19] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 184 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 34 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-20 18:44:19] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-20 18:44:20] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-20 18:44:20] [INFO ] Invariant cache hit.
[2023-03-20 18:44:20] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-20 18:44:20] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 18:44:20] [INFO ] Invariant cache hit.
[2023-03-20 18:44:20] [INFO ] Dead Transitions using invariants and state equation in 187 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 605 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 250 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 479 ms.
Stack based approach found an accepted trace after 68906 steps with 0 reset with depth 68907 and stack size 36558 in 389 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-01 finished in 1783 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 16 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-20 18:44:21] [INFO ] Invariant cache hit.
[2023-03-20 18:44:21] [INFO ] Implicit Places using invariants in 149 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 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 170 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 137 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 372 ms.
Product exploration explored 100000 steps with 50000 reset in 339 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 200 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 1263 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 15 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-20 18:44:22] [INFO ] Invariant cache hit.
[2023-03-20 18:44:23] [INFO ] Implicit Places using invariants in 122 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 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 146 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 197 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 20046 reset in 393 ms.
Product exploration explored 100000 steps with 19972 reset in 409 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 369 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 197 ms :[p0, false, p0, false]
Finished random walk after 39 steps, including 0 resets, run visited all 4 properties in 6 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 456 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 178 ms :[p0, false, p0, false]
Stuttering acceptance computed with spot in 136 ms :[p0, false, p0, false]
// Phase 1: matrix 376 rows 205 cols
[2023-03-20 18:44:25] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:44:25] [INFO ] [Real]Absence check using 18 positive place invariants in 10 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 198 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 2927 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 11 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2023-03-20 18:44:25] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-20 18:44:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-20 18:44:25] [INFO ] Invariant cache hit.
[2023-03-20 18:44:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-20 18:44:26] [INFO ] Invariant cache hit.
[2023-03-20 18:44:26] [INFO ] Dead Transitions using invariants and state equation in 159 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 433 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 142 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 257 ms.
Product exploration explored 100000 steps with 0 reset in 273 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 901 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 145 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 230 ms. (steps per millisecond=43 ) properties (out of 9) seen :7
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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:44:28] [INFO ] Invariant cache hit.
[2023-03-20 18:44:28] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-20 18:44:28] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:44:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-20 18:44:28] [INFO ] After 84ms 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 1 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 1183 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 147 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-20 18:44:30] [INFO ] Invariant cache hit.
[2023-03-20 18:44:30] [INFO ] [Real]Absence check using 19 positive place invariants in 8 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 481 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 4812 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 0 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 23 ms. Remains 294 /302 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 294 cols
[2023-03-20 18:44:30] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-20 18:44:30] [INFO ] Implicit Places using invariants in 278 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 281 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 11 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 315 ms. Remains : 293/302 places, 464/472 transitions.
Stuttering acceptance computed with spot in 101 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 4814 reset in 312 ms.
Product exploration explored 100000 steps with 4838 reset in 317 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 185 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 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=60 )
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 210 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 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 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 12 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 293 cols
[2023-03-20 18:44:32] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 18:44:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 18:44:32] [INFO ] Invariant cache hit.
[2023-03-20 18:44:32] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-20 18:44:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 18:44:32] [INFO ] Invariant cache hit.
[2023-03-20 18:44:32] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 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 180 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 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 208 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=104 )
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 226 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 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4778 reset in 304 ms.
Product exploration explored 100000 steps with 4813 reset in 315 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 8 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2023-03-20 18:44:34] [INFO ] Invariant cache hit.
[2023-03-20 18:44:34] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 18:44:34] [INFO ] Invariant cache hit.
[2023-03-20 18:44:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-20 18:44:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 18:44:34] [INFO ] Invariant cache hit.
[2023-03-20 18:44:35] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 544 ms. Remains : 293/293 places, 464/464 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05 finished in 4467 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 57 ms. Remains 126 /302 variables (removed 176) and now considering 264/472 (removed 208) transitions.
// Phase 1: matrix 264 rows 126 cols
[2023-03-20 18:44:35] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-20 18:44:35] [INFO ] Implicit Places using invariants in 335 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 338 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 400 ms. Remains : 124/302 places, 264/472 transitions.
Stuttering acceptance computed with spot in 37 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 8406 reset in 295 ms.
Product exploration explored 100000 steps with 8384 reset in 317 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 112 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 28 ms :[p0]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 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 28 ms :[p0]
Stuttering acceptance computed with spot in 25 ms :[p0]
// Phase 1: matrix 264 rows 124 cols
[2023-03-20 18:44:36] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-20 18:44:36] [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 77 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 1604 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 23 ms. Remains 131 /302 variables (removed 171) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 131 cols
[2023-03-20 18:44:36] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-20 18:44:36] [INFO ] Implicit Places using invariants in 80 ms returned [0, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 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 128 ms. Remains : 129/302 places, 176/472 transitions.
Stuttering acceptance computed with spot in 40 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 5549 reset in 255 ms.
Product exploration explored 100000 steps with 5570 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 176 rows 129 cols
[2023-03-20 18:44:37] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-20 18:44:37] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-20 18:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:44:37] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-20 18:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:44:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-20 18:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:44:38] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-20 18:44:38] [INFO ] Computed and/alt/rep : 144/384/144 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-20 18:44:38] [INFO ] Added : 127 causal constraints over 26 iterations in 663 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 33 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-20 18:44:38] [INFO ] Invariant cache hit.
[2023-03-20 18:44:39] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-20 18:44:39] [INFO ] Invariant cache hit.
[2023-03-20 18:44:39] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-20 18:44:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:44:39] [INFO ] Invariant cache hit.
[2023-03-20 18:44:39] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 129/129 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-20 18:44:39] [INFO ] Invariant cache hit.
[2023-03-20 18:44:39] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-20 18:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:44:39] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-20 18:44:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:44:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-20 18:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:44:39] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-20 18:44:39] [INFO ] Computed and/alt/rep : 144/384/144 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-20 18:44:40] [INFO ] Added : 131 causal constraints over 27 iterations in 475 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5553 reset in 254 ms.
Stack based approach found an accepted trace after 51620 steps with 2860 reset with depth 8 and stack size 8 in 135 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-11 finished in 4113 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-20 18:44:40] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-20 18:44:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 18:44:41] [INFO ] Invariant cache hit.
[2023-03-20 18:44:41] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-20 18:44:41] [INFO ] Invariant cache hit.
[2023-03-20 18:44:41] [INFO ] Dead Transitions using invariants and state equation in 169 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 660 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 281 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 33276 reset in 302 ms.
Product exploration explored 100000 steps with 33285 reset in 303 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 646 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 295 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 286 ms. (steps per millisecond=34 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:44:43] [INFO ] Invariant cache hit.
[2023-03-20 18:44:43] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:44:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-20 18:44:44] [INFO ] After 79ms 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 888 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 206 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 400 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 3 ms. Remains 206 /206 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 18:44:45] [INFO ] Invariant cache hit.
[2023-03-20 18:44:46] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-20 18:44:46] [INFO ] Invariant cache hit.
[2023-03-20 18:44:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-20 18:44:46] [INFO ] Invariant cache hit.
[2023-03-20 18:44:46] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 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 616 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 245 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 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :7
Finished Best-First random walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
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 750 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 211 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 259 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 200 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 857 reset in 325 ms.
Product exploration explored 100000 steps with 826 reset in 345 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 327 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 0 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 25 ms. Remains 206 /206 variables (removed 0) and now considering 400/376 (removed -24) transitions.
[2023-03-20 18:44:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 206 cols
[2023-03-20 18:44:50] [INFO ] Computed 19 place invariants in 35 ms
[2023-03-20 18:44:50] [INFO ] Dead Transitions using invariants and state equation in 552 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 654 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-20 18:44:50] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-20 18:44:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 18:44:50] [INFO ] Invariant cache hit.
[2023-03-20 18:44:50] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-20 18:44:50] [INFO ] Invariant cache hit.
[2023-03-20 18:44:50] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 206/206 places, 376/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 finished in 10232 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 3 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2023-03-20 18:44:51] [INFO ] Invariant cache hit.
[2023-03-20 18:44:51] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-20 18:44:51] [INFO ] Invariant cache hit.
[2023-03-20 18:44:51] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-20 18:44:51] [INFO ] Invariant cache hit.
[2023-03-20 18:44:51] [INFO ] Dead Transitions using invariants and state equation in 158 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 923 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 177 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 13 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-13 finished in 1130 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 30 ms. Remains 262 /302 variables (removed 40) and now considering 432/472 (removed 40) transitions.
// Phase 1: matrix 432 rows 262 cols
[2023-03-20 18:44:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-20 18:44:52] [INFO ] Implicit Places using invariants in 146 ms returned [205]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 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 25 ms. Remains 229 /261 variables (removed 32) and now considering 400/432 (removed 32) transitions.
// Phase 1: matrix 400 rows 229 cols
[2023-03-20 18:44:52] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 18:44:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-20 18:44:52] [INFO ] Invariant cache hit.
[2023-03-20 18:44:52] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 309 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 522 ms. Remains : 229/302 places, 400/472 transitions.
Stuttering acceptance computed with spot in 100 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 4 reset in 302 ms.
Stack based approach found an accepted trace after 1393 steps with 20 reset with depth 919 and stack size 919 in 7 ms.
FORMULA UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-14 finished in 943 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))))'
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 258 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 10 ms. Remains 198 /302 variables (removed 104) and now considering 368/472 (removed 104) transitions.
// Phase 1: matrix 368 rows 198 cols
[2023-03-20 18:44:53] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-20 18:44:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 18:44:53] [INFO ] Invariant cache hit.
[2023-03-20 18:44:53] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-20 18:44:53] [INFO ] Invariant cache hit.
[2023-03-20 18:44:54] [INFO ] Dead Transitions using invariants and state equation in 164 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 424 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 33265 reset in 375 ms.
Product exploration explored 100000 steps with 33368 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND 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 698 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 157 ms. (steps per millisecond=63 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:44:55] [INFO ] Invariant cache hit.
[2023-03-20 18:44:56] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:44:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-20 18:44:56] [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 953 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 221 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 207 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 1 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-20 18:44:57] [INFO ] Invariant cache hit.
[2023-03-20 18:44:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-20 18:44:57] [INFO ] Invariant cache hit.
[2023-03-20 18:44:57] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-20 18:44:57] [INFO ] Invariant cache hit.
[2023-03-20 18:44:58] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 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 613 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 206 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 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :7
Finished Best-First random walk after 220 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=220 )
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 826 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 218 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)]
Stuttering acceptance computed with spot in 227 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 970 reset in 369 ms.
Product exploration explored 100000 steps with 1045 reset in 384 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 355 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 4 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2023-03-20 18:45:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 18:45:01] [INFO ] Invariant cache hit.
[2023-03-20 18:45:01] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 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-20 18:45:01] [INFO ] Invariant cache hit.
[2023-03-20 18:45:01] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 18:45:01] [INFO ] Invariant cache hit.
[2023-03-20 18:45:02] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-20 18:45:02] [INFO ] Invariant cache hit.
[2023-03-20 18:45:02] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 198/198 places, 368/368 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12 finished in 9024 ms.
[2023-03-20 18:45:02] [INFO ] Flatten gal took : 26 ms
[2023-03-20 18:45:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 18:45:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 5 ms.
Total runtime 44868 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2347/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2347/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12

BK_STOP 1679338038780

--------------------
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
mcc2023
ltl formula name UtilityControlRoom-COL-Z4T4N08-LTLCardinality-05
ltl formula formula --ltl=/tmp/2347/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2347/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2347/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2347/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2347/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (!prev)
ltl formula name UtilityControlRoom-COL-Z4T4N08-LTLCardinality-12
ltl formula formula --ltl=/tmp/2347/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2347/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2347/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2347/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2347/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-COL-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 r489-tall-167912707701075"
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 ;