About the Execution of LTSMin+red for UtilityControlRoom-PT-Z2T3N06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 429.476 | 17452.00 | 28450.00 | 277.80 | FFFFFFTFTF?FFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707701099.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-PT-Z2T3N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707701099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 14K Feb 26 14:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 14:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 14:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 49K Feb 26 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Feb 26 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K 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-PT-Z2T3N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679339789774
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-PT-Z2T3N06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 19:16:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:16:31] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-20 19:16:31] [INFO ] Transformed 106 places.
[2023-03-20 19:16:31] [INFO ] Transformed 162 transitions.
[2023-03-20 19:16:31] [INFO ] Parsed PT model containing 106 places and 162 transitions and 510 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2023-03-20 19:16:31] [INFO ] Computed 15 place invariants in 15 ms
[2023-03-20 19:16:31] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 19:16:31] [INFO ] Invariant cache hit.
[2023-03-20 19:16:31] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-20 19:16:31] [INFO ] Invariant cache hit.
[2023-03-20 19:16:31] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 106/106 places, 138/138 transitions.
Support contains 97 out of 106 places after structural reductions.
[2023-03-20 19:16:32] [INFO ] Flatten gal took : 39 ms
[2023-03-20 19:16:32] [INFO ] Flatten gal took : 13 ms
[2023-03-20 19:16:32] [INFO ] Input system was already deterministic with 138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 39) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 19:16:32] [INFO ] Invariant cache hit.
[2023-03-20 19:16:32] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-20 19:16:33] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-20 19:16:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-20 19:16:33] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(p1) U p2)))'
Support contains 55 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2023-03-20 19:16:33] [INFO ] Invariant cache hit.
[2023-03-20 19:16:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-20 19:16:33] [INFO ] Invariant cache hit.
[2023-03-20 19:16:33] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-20 19:16:33] [INFO ] Invariant cache hit.
[2023-03-20 19:16:33] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 106/106 places, 138/138 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-00 finished in 545 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||X(G(p1))||(p1 U (p2||G(p1))))))))'
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 14 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2023-03-20 19:16:34] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 19:16:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 19:16:34] [INFO ] Invariant cache hit.
[2023-03-20 19:16:34] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-20 19:16:34] [INFO ] Invariant cache hit.
[2023-03-20 19:16:34] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 94/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GT s63 (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55)) (LEQ (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55) (ADD s56 s57 s58 s59 s60...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 44 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-02 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((p1 U p2)&&G(F(p3)))))'
Support contains 21 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 82 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 70 transition count 90
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 64 transition count 84
Applied a total of 96 rules in 25 ms. Remains 64 /106 variables (removed 42) and now considering 84/138 (removed 54) transitions.
// Phase 1: matrix 84 rows 64 cols
[2023-03-20 19:16:34] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-20 19:16:34] [INFO ] Implicit Places using invariants in 54 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/106 places, 84/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 63/106 places, 84/138 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) s32), p1:(LEQ 3 s32), p0:(LEQ 2 (ADD s0 s1)), p3:(GT 1 (ADD s45 s46 s47 s48 s49 s50))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 56 reset in 322 ms.
Stack based approach found an accepted trace after 364 steps with 1 reset with depth 330 and stack size 330 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-05 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0))) U (p1 U X(p2))))'
Support contains 42 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2023-03-20 19:16:35] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-20 19:16:35] [INFO ] Implicit Places using invariants in 52 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 105/106 places, 138/138 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55) (ADD s75 s76 s77 s78 s79 s80)), p0:(LEQ (ADD ...], 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 50000 reset in 413 ms.
Product exploration explored 100000 steps with 50000 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 14 factoid took 469 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-06 finished in 1621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 82 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 70 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 69 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 69 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 63 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 63 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 57 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 57 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 51 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 51 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 51 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 45 transition count 42
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 153 place count 38 transition count 36
Applied a total of 153 rules in 26 ms. Remains 38 /106 variables (removed 68) and now considering 36/138 (removed 102) transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-20 19:16:36] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-20 19:16:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 19:16:36] [INFO ] Invariant cache hit.
[2023-03-20 19:16:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-20 19:16:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 19:16:36] [INFO ] Invariant cache hit.
[2023-03-20 19:16:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/106 places, 36/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 38/106 places, 36/138 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 28 reset in 124 ms.
Stack based approach found an accepted trace after 33 steps with 9 reset with depth 5 and stack size 5 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-07 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&G(F(p2))))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 127
Applied a total of 22 rules in 8 ms. Remains 95 /106 variables (removed 11) and now considering 127/138 (removed 11) transitions.
// Phase 1: matrix 127 rows 95 cols
[2023-03-20 19:16:37] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 19:16:37] [INFO ] Implicit Places using invariants in 49 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 127/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 94/106 places, 127/138 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s26 s79), p1:(OR (LEQ s26 s79) (GT s49 s41)), p2:(GT s59 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3525 reset in 155 ms.
Product exploration explored 100000 steps with 3616 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 487 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2)]
Knowledge based reduction with 8 factoid took 507 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 127 rows 94 cols
[2023-03-20 19:16:38] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 19:16:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-09 finished in 2266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(X(X(p1))&&F(p2)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 127
Applied a total of 22 rules in 5 ms. Remains 95 /106 variables (removed 11) and now considering 127/138 (removed 11) transitions.
// Phase 1: matrix 127 rows 95 cols
[2023-03-20 19:16:39] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 19:16:39] [INFO ] Implicit Places using invariants in 54 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 127/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 94/106 places, 127/138 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p2:(LEQ 1 s68), p0:(LEQ s22 s63), p1:(LEQ s62 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Product exploration explored 100000 steps with 25000 reset in 144 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 p2)), (X (X (NOT p2))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Finished random walk after 432 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 94 cols
[2023-03-20 19:16:41] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 19:16:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 19:16:41] [INFO ] Invariant cache hit.
[2023-03-20 19:16:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-20 19:16:41] [INFO ] Invariant cache hit.
[2023-03-20 19:16:41] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 94/94 places, 127/127 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Finished random walk after 3013 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=273 )
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 127/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 127
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 1 place count 94 transition count 138
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 12 place count 94 transition count 138
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 37 place count 94 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 47 place count 94 transition count 133
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 47 rules in 15 ms. Remains 94 /94 variables (removed 0) and now considering 133/127 (removed -6) transitions.
[2023-03-20 19:16:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 133 rows 94 cols
[2023-03-20 19:16:42] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-20 19:16:43] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/94 places, 133/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 94/94 places, 133/127 transitions.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 127/127 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 94 cols
[2023-03-20 19:16:43] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 94/94 places, 127/127 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-10 finished in 3917 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 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 82 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 70 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 69 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 69 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 63 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 63 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 57 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 57 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 51 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 51 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 51 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 45 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 40 transition count 37
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 162 place count 34 transition count 31
Applied a total of 162 rules in 17 ms. Remains 34 /106 variables (removed 72) and now considering 31/138 (removed 107) transitions.
// Phase 1: matrix 31 rows 34 cols
[2023-03-20 19:16:43] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 33 ms returned [13, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/106 places, 31/138 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 27 transition count 26
Applied a total of 10 rules in 2 ms. Remains 27 /32 variables (removed 5) and now considering 26/31 (removed 5) transitions.
// Phase 1: matrix 26 rows 27 cols
[2023-03-20 19:16:43] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 19:16:43] [INFO ] Invariant cache hit.
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/106 places, 26/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 27/106 places, 26/138 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s13)], 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 4218 reset in 119 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-11 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(G(p1))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 3 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2023-03-20 19:16:43] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 19:16:43] [INFO ] Implicit Places using invariants in 44 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), 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}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 1 s57), p1:(GT s0 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9440 reset in 148 ms.
Product exploration explored 100000 steps with 9278 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 126 rows 93 cols
[2023-03-20 19:16:45] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 19:16:45] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-12 finished in 1600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 106 transition count 116
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 55 place count 84 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 55 place count 84 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 72 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 72 transition count 93
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 103 place count 60 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 60 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 59 transition count 68
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 58 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 52 transition count 62
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 52 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 125 place count 46 transition count 50
Iterating global reduction 2 with 6 rules applied. Total rules applied 131 place count 46 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 41 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 41 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 146 place count 41 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 37 transition count 36
Applied a total of 154 rules in 23 ms. Remains 37 /106 variables (removed 69) and now considering 36/138 (removed 102) transitions.
// Phase 1: matrix 36 rows 37 cols
[2023-03-20 19:16:45] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 19:16:45] [INFO ] Implicit Places using invariants in 30 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/106 places, 36/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 30 transition count 30
Applied a total of 12 rules in 3 ms. Remains 30 /36 variables (removed 6) and now considering 30/36 (removed 6) transitions.
// Phase 1: matrix 30 rows 30 cols
[2023-03-20 19:16:45] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-20 19:16:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 19:16:45] [INFO ] Invariant cache hit.
[2023-03-20 19:16:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/106 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 30/106 places, 30/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s18 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-13 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1 U p2)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 2 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2023-03-20 19:16:45] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 19:16:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 19:16:45] [INFO ] Invariant cache hit.
[2023-03-20 19:16:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-20 19:16:45] [INFO ] Invariant cache hit.
[2023-03-20 19:16:45] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 94/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s63 s77), p1:(LEQ 2 s0), p0:(LEQ 1 s77)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Stack based approach found an accepted trace after 1545 steps with 0 reset with depth 1546 and stack size 1546 in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N06-LTLCardinality-14 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(X(X(p1))&&F(p2)))))'
[2023-03-20 19:16:46] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:16:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 19:16:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 138 transitions and 414 arcs took 2 ms.
Total runtime 14906 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1316/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : UtilityControlRoom-PT-Z2T3N06-LTLCardinality-10
BK_STOP 1679339807226
--------------------
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-PT-Z2T3N06-LTLCardinality-10
ltl formula formula --ltl=/tmp/1316/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 106 places, 138 transitions and 414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1316/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1316/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1316/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1316/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 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 (fasttop)
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-PT-Z2T3N06"
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-PT-Z2T3N06, 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-167912707701099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N06.tgz
mv UtilityControlRoom-PT-Z2T3N06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;