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.r229-tall-167856413300459.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 itstools
Input is LeafsetExtension-PT-S08C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413300459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K Mar 5 18:22 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 LeafsetExtension-PT-S08C3-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679489752870

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 12:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 12:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:55:54] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-22 12:55:54] [INFO ] Transformed 462 places.
[2023-03-22 12:55:54] [INFO ] Transformed 409 transitions.
[2023-03-22 12:55:54] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 62 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 389 transition count 409
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 122 place count 340 transition count 360
Iterating global reduction 1 with 49 rules applied. Total rules applied 171 place count 340 transition count 360
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 200 place count 311 transition count 331
Iterating global reduction 1 with 29 rules applied. Total rules applied 229 place count 311 transition count 331
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 250 place count 290 transition count 310
Iterating global reduction 1 with 21 rules applied. Total rules applied 271 place count 290 transition count 310
Applied a total of 271 rules in 66 ms. Remains 290 /462 variables (removed 172) and now considering 310/409 (removed 99) transitions.
// Phase 1: matrix 310 rows 290 cols
[2023-03-22 12:55:54] [INFO ] Computed 30 place invariants in 26 ms
[2023-03-22 12:55:55] [INFO ] Implicit Places using invariants in 395 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 421 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/462 places, 310/409 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 289/462 places, 310/409 transitions.
Support contains 62 out of 289 places after structural reductions.
[2023-03-22 12:55:55] [INFO ] Flatten gal took : 49 ms
[2023-03-22 12:55:55] [INFO ] Flatten gal took : 23 ms
[2023-03-22 12:55:55] [INFO ] Input system was already deterministic with 310 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 38) seen :30
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 310 rows 289 cols
[2023-03-22 12:55:56] [INFO ] Computed 29 place invariants in 17 ms
[2023-03-22 12:55:56] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-22 12:55:56] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 12:55:56] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-22 12:55:56] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 289 stabilizing places and 310 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 310
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-13 FALSE 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((X(X(X(G(p0)))) U (p1&&X(X(X(G(p0))))))))'
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 246 transition count 278
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 246 transition count 278
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 245 transition count 278
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 100 place count 221 transition count 254
Iterating global reduction 2 with 24 rules applied. Total rules applied 124 place count 221 transition count 254
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 219 transition count 254
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 148 place count 197 transition count 232
Iterating global reduction 3 with 22 rules applied. Total rules applied 170 place count 197 transition count 232
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 3 with 12 rules applied. Total rules applied 182 place count 185 transition count 232
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 196 place count 171 transition count 218
Iterating global reduction 4 with 14 rules applied. Total rules applied 210 place count 171 transition count 218
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 223 place count 158 transition count 205
Iterating global reduction 4 with 13 rules applied. Total rules applied 236 place count 158 transition count 205
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 249 place count 145 transition count 192
Iterating global reduction 4 with 13 rules applied. Total rules applied 262 place count 145 transition count 192
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 280 place count 127 transition count 174
Iterating global reduction 4 with 18 rules applied. Total rules applied 298 place count 127 transition count 174
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 333 place count 92 transition count 139
Iterating global reduction 4 with 35 rules applied. Total rules applied 368 place count 92 transition count 139
Applied a total of 368 rules in 41 ms. Remains 92 /289 variables (removed 197) and now considering 139/310 (removed 171) transitions.
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 96 transitions (discarded 43 similar events)
// Phase 1: matrix 96 rows 92 cols
[2023-03-22 12:55:57] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants in 75 ms returned [19, 23, 27, 31, 33, 48, 57, 71, 77, 81]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 78 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/289 places, 139/310 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 61 transition count 118
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 61 transition count 118
Applied a total of 42 rules in 2 ms. Remains 61 /82 variables (removed 21) and now considering 118/139 (removed 21) transitions.
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 69 transitions (discarded 49 similar events)
// Phase 1: matrix 69 rows 61 cols
[2023-03-22 12:55:57] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 69 transitions (discarded 49 similar events)
[2023-03-22 12:55:57] [INFO ] Invariant cache hit.
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/289 places, 118/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 61/289 places, 118/310 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s57), p0:(GT s43 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-00 finished in 630 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)||(!p0&&X(G(p1))))))'
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 246 transition count 278
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 246 transition count 278
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 99 place count 222 transition count 254
Iterating global reduction 1 with 24 rules applied. Total rules applied 123 place count 222 transition count 254
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 220 transition count 254
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 147 place count 198 transition count 232
Iterating global reduction 2 with 22 rules applied. Total rules applied 169 place count 198 transition count 232
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 182 place count 185 transition count 232
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 196 place count 171 transition count 218
Iterating global reduction 3 with 14 rules applied. Total rules applied 210 place count 171 transition count 218
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 224 place count 157 transition count 204
Iterating global reduction 3 with 14 rules applied. Total rules applied 238 place count 157 transition count 204
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 252 place count 143 transition count 190
Iterating global reduction 3 with 14 rules applied. Total rules applied 266 place count 143 transition count 190
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 283 place count 126 transition count 173
Iterating global reduction 3 with 17 rules applied. Total rules applied 300 place count 126 transition count 173
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 342 place count 84 transition count 131
Iterating global reduction 3 with 42 rules applied. Total rules applied 384 place count 84 transition count 131
Applied a total of 384 rules in 37 ms. Remains 84 /289 variables (removed 205) and now considering 131/310 (removed 179) transitions.
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 86 transitions (discarded 45 similar events)
// Phase 1: matrix 86 rows 84 cols
[2023-03-22 12:55:57] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants in 61 ms returned [19, 24, 40, 44, 46, 49, 57, 62, 66, 70, 74]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 63 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/289 places, 131/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 54 transition count 112
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 54 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 53 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 53 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 52 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 52 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 51 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 51 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 50 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 50 transition count 108
Applied a total of 46 rules in 5 ms. Remains 50 /73 variables (removed 23) and now considering 108/131 (removed 23) transitions.
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2023-03-22 12:55:57] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 12:55:57] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
[2023-03-22 12:55:57] [INFO ] Invariant cache hit.
[2023-03-22 12:55:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/289 places, 108/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 50/289 places, 108/310 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s14 s24), p1:(LEQ 1 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 50 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-01 finished in 1013 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 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Graph (complete) has 705 edges and 289 vertex of which 275 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 275 transition count 250
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 217 transition count 250
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 117 place count 217 transition count 233
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 151 place count 200 transition count 233
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 191 transition count 224
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 191 transition count 224
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 201 place count 175 transition count 208
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 161 transition count 194
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 161 transition count 194
Applied a total of 229 rules in 45 ms. Remains 161 /289 variables (removed 128) and now considering 194/310 (removed 116) transitions.
// Phase 1: matrix 194 rows 161 cols
[2023-03-22 12:55:58] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-22 12:55:58] [INFO ] Implicit Places using invariants in 130 ms returned [3, 8, 15, 22, 29, 32, 37, 44, 47, 52, 59, 61, 63, 68, 75, 78, 83, 90, 93, 98, 105, 115, 122, 125, 139]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 131 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/289 places, 194/310 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 136 transition count 177
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 119 transition count 177
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 99 place count 54 transition count 112
Iterating global reduction 0 with 65 rules applied. Total rules applied 164 place count 54 transition count 112
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 177 place count 41 transition count 99
Iterating global reduction 0 with 13 rules applied. Total rules applied 190 place count 41 transition count 99
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 200 place count 36 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 35 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 35 transition count 93
Applied a total of 202 rules in 24 ms. Remains 35 /136 variables (removed 101) and now considering 93/194 (removed 101) transitions.
[2023-03-22 12:55:58] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 35 cols
[2023-03-22 12:55:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:55:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 12:55:58] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
[2023-03-22 12:55:58] [INFO ] Invariant cache hit.
[2023-03-22 12:55:58] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/289 places, 93/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 35/289 places, 93/310 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s25 s19)], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-03 finished in 345 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((X(p0)&&G(p1)))||X((G(p2)||(p2&&F(p3)))))))'
Support contains 6 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 41 place count 248 transition count 280
Iterating global reduction 1 with 30 rules applied. Total rules applied 71 place count 248 transition count 280
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 247 transition count 280
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 95 place count 224 transition count 257
Iterating global reduction 2 with 23 rules applied. Total rules applied 118 place count 224 transition count 257
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 222 transition count 257
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 142 place count 200 transition count 235
Iterating global reduction 3 with 22 rules applied. Total rules applied 164 place count 200 transition count 235
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 3 with 10 rules applied. Total rules applied 174 place count 190 transition count 235
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 186 place count 178 transition count 223
Iterating global reduction 4 with 12 rules applied. Total rules applied 198 place count 178 transition count 223
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 210 place count 166 transition count 211
Iterating global reduction 4 with 12 rules applied. Total rules applied 222 place count 166 transition count 211
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 232 place count 156 transition count 201
Iterating global reduction 4 with 10 rules applied. Total rules applied 242 place count 156 transition count 201
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 258 place count 140 transition count 185
Iterating global reduction 4 with 16 rules applied. Total rules applied 274 place count 140 transition count 185
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 302 place count 112 transition count 157
Iterating global reduction 4 with 28 rules applied. Total rules applied 330 place count 112 transition count 157
Applied a total of 330 rules in 26 ms. Remains 112 /289 variables (removed 177) and now considering 157/310 (removed 153) transitions.
[2023-03-22 12:55:59] [INFO ] Flow matrix only has 123 transitions (discarded 34 similar events)
// Phase 1: matrix 123 rows 112 cols
[2023-03-22 12:55:59] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 12:55:59] [INFO ] Implicit Places using invariants in 65 ms returned [22, 44, 48, 53, 61, 63, 67, 82, 86, 95, 100]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 67 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/289 places, 157/310 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 76 transition count 132
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 76 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 75 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 75 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 74 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 74 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 73 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 73 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 72 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 72 transition count 128
Applied a total of 58 rules in 3 ms. Remains 72 /101 variables (removed 29) and now considering 128/157 (removed 29) transitions.
[2023-03-22 12:55:59] [INFO ] Flow matrix only has 86 transitions (discarded 42 similar events)
// Phase 1: matrix 86 rows 72 cols
[2023-03-22 12:55:59] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 12:55:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 12:55:59] [INFO ] Flow matrix only has 86 transitions (discarded 42 similar events)
[2023-03-22 12:55:59] [INFO ] Invariant cache hit.
[2023-03-22 12:55:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 72/289 places, 128/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 72/289 places, 128/310 transitions.
Stuttering acceptance computed with spot in 562 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={0} source=9 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=10 dest: 9}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={0} source=10 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(LEQ s40 s8), p2:(GT 1 s46), p3:(GT 1 s24), p0:(LEQ s37 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33439 reset in 228 ms.
Product exploration explored 100000 steps with 33401 reset in 227 ms.
Computed a total of 72 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 128
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p2)), (F (OR (G p3) (G (NOT p3)))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p3 p0)
Knowledge based reduction with 16 factoid took 763 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-04 finished in 2058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 6 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 41 place count 248 transition count 280
Iterating global reduction 1 with 30 rules applied. Total rules applied 71 place count 248 transition count 280
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 247 transition count 280
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 94 place count 225 transition count 258
Iterating global reduction 2 with 22 rules applied. Total rules applied 116 place count 225 transition count 258
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 224 transition count 258
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 136 place count 205 transition count 239
Iterating global reduction 3 with 19 rules applied. Total rules applied 155 place count 205 transition count 239
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 3 with 10 rules applied. Total rules applied 165 place count 195 transition count 239
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 176 place count 184 transition count 228
Iterating global reduction 4 with 11 rules applied. Total rules applied 187 place count 184 transition count 228
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 198 place count 173 transition count 217
Iterating global reduction 4 with 11 rules applied. Total rules applied 209 place count 173 transition count 217
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 219 place count 163 transition count 207
Iterating global reduction 4 with 10 rules applied. Total rules applied 229 place count 163 transition count 207
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 241 place count 151 transition count 195
Iterating global reduction 4 with 12 rules applied. Total rules applied 253 place count 151 transition count 195
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 280 place count 124 transition count 168
Iterating global reduction 4 with 27 rules applied. Total rules applied 307 place count 124 transition count 168
Applied a total of 307 rules in 24 ms. Remains 124 /289 variables (removed 165) and now considering 168/310 (removed 142) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 136 transitions (discarded 32 similar events)
// Phase 1: matrix 136 rows 124 cols
[2023-03-22 12:56:01] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 74 ms returned [19, 33, 37, 41, 49, 51, 61, 76, 81, 95, 111]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 77 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/289 places, 168/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 85 transition count 140
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 84 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 83 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 83 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 82 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 82 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 81 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 81 transition count 136
Applied a total of 64 rules in 5 ms. Remains 81 /113 variables (removed 32) and now considering 136/168 (removed 32) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 96 transitions (discarded 40 similar events)
// Phase 1: matrix 96 rows 81 cols
[2023-03-22 12:56:01] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 96 transitions (discarded 40 similar events)
[2023-03-22 12:56:01] [INFO ] Invariant cache hit.
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/289 places, 136/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 81/289 places, 136/310 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ s66 s19) (LEQ s52 s27)), p0:(LEQ s32 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 116 steps with 4 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-05 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 277 transition count 310
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 43 place count 246 transition count 279
Iterating global reduction 1 with 31 rules applied. Total rules applied 74 place count 246 transition count 279
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 245 transition count 279
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 98 place count 222 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 121 place count 222 transition count 256
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 220 transition count 256
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 144 place count 199 transition count 235
Iterating global reduction 3 with 21 rules applied. Total rules applied 165 place count 199 transition count 235
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 176 place count 188 transition count 235
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 188 place count 176 transition count 223
Iterating global reduction 4 with 12 rules applied. Total rules applied 200 place count 176 transition count 223
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 211 place count 165 transition count 212
Iterating global reduction 4 with 11 rules applied. Total rules applied 222 place count 165 transition count 212
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 233 place count 154 transition count 201
Iterating global reduction 4 with 11 rules applied. Total rules applied 244 place count 154 transition count 201
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 260 place count 138 transition count 185
Iterating global reduction 4 with 16 rules applied. Total rules applied 276 place count 138 transition count 185
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 303 place count 111 transition count 158
Iterating global reduction 4 with 27 rules applied. Total rules applied 330 place count 111 transition count 158
Applied a total of 330 rules in 26 ms. Remains 111 /289 variables (removed 178) and now considering 158/310 (removed 152) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 124 transitions (discarded 34 similar events)
// Phase 1: matrix 124 rows 111 cols
[2023-03-22 12:56:01] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 75 ms returned [19, 34, 38, 53, 55, 64, 79, 83, 93, 98]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 76 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/289 places, 158/310 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 75 transition count 132
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 75 transition count 132
Applied a total of 52 rules in 2 ms. Remains 75 /101 variables (removed 26) and now considering 132/158 (removed 26) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 92 transitions (discarded 40 similar events)
// Phase 1: matrix 92 rows 75 cols
[2023-03-22 12:56:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 92 transitions (discarded 40 similar events)
[2023-03-22 12:56:01] [INFO ] Invariant cache hit.
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/289 places, 132/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 75/289 places, 132/310 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s51 s59) (OR (LEQ s71 s20) (GT s49 s30)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-06 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1&&X(p2)&&F(!p1)))))))'
Support contains 6 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 279 transition count 310
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 40 place count 249 transition count 280
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 249 transition count 280
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 248 transition count 280
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 93 place count 226 transition count 258
Iterating global reduction 2 with 22 rules applied. Total rules applied 115 place count 226 transition count 258
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 224 transition count 258
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 137 place count 204 transition count 238
Iterating global reduction 3 with 20 rules applied. Total rules applied 157 place count 204 transition count 238
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 3 with 12 rules applied. Total rules applied 169 place count 192 transition count 238
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 183 place count 178 transition count 224
Iterating global reduction 4 with 14 rules applied. Total rules applied 197 place count 178 transition count 224
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 211 place count 164 transition count 210
Iterating global reduction 4 with 14 rules applied. Total rules applied 225 place count 164 transition count 210
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 239 place count 150 transition count 196
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 150 transition count 196
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 272 place count 131 transition count 177
Iterating global reduction 4 with 19 rules applied. Total rules applied 291 place count 131 transition count 177
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 331 place count 91 transition count 137
Iterating global reduction 4 with 40 rules applied. Total rules applied 371 place count 91 transition count 137
Applied a total of 371 rules in 15 ms. Remains 91 /289 variables (removed 198) and now considering 137/310 (removed 173) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 90 transitions (discarded 47 similar events)
// Phase 1: matrix 90 rows 91 cols
[2023-03-22 12:56:01] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 56 ms returned [19, 23, 27, 31, 33, 40, 44, 62, 80]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/289 places, 137/310 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 125
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 125
Applied a total of 24 rules in 1 ms. Remains 70 /82 variables (removed 12) and now considering 125/137 (removed 12) transitions.
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 73 transitions (discarded 52 similar events)
// Phase 1: matrix 73 rows 70 cols
[2023-03-22 12:56:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 12:56:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 12:56:01] [INFO ] Flow matrix only has 73 transitions (discarded 52 similar events)
[2023-03-22 12:56:01] [INFO ] Invariant cache hit.
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 70/289 places, 125/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 70/289 places, 125/310 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), true, (NOT p2), p1]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s39 s60), p1:(GT s22 s56), p2:(LEQ s31 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 2 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-07 finished in 423 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 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Graph (complete) has 705 edges and 289 vertex of which 275 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 275 transition count 257
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 224 transition count 257
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 103 place count 224 transition count 240
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 137 place count 207 transition count 240
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 153 place count 191 transition count 224
Iterating global reduction 2 with 16 rules applied. Total rules applied 169 place count 191 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 178 place count 182 transition count 215
Iterating global reduction 2 with 9 rules applied. Total rules applied 187 place count 182 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 187 place count 182 transition count 214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 181 transition count 214
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 217 place count 167 transition count 200
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 226 place count 158 transition count 191
Iterating global reduction 2 with 9 rules applied. Total rules applied 235 place count 158 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 235 place count 158 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 157 transition count 190
Applied a total of 237 rules in 43 ms. Remains 157 /289 variables (removed 132) and now considering 190/310 (removed 120) transitions.
// Phase 1: matrix 190 rows 157 cols
[2023-03-22 12:56:02] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants in 171 ms returned [3, 8, 15, 22, 29, 32, 37, 44, 47, 52, 59, 61, 63, 68, 75, 78, 83, 90, 93, 98, 105, 108, 113, 120, 123, 128, 135]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 172 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/289 places, 190/310 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 130 transition count 172
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 112 transition count 172
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 106 place count 42 transition count 102
Iterating global reduction 0 with 70 rules applied. Total rules applied 176 place count 42 transition count 102
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 192 place count 26 transition count 86
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 26 transition count 86
Applied a total of 208 rules in 7 ms. Remains 26 /130 variables (removed 104) and now considering 86/190 (removed 104) transitions.
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 24 transitions (discarded 62 similar events)
// Phase 1: matrix 24 rows 26 cols
[2023-03-22 12:56:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 24 transitions (discarded 62 similar events)
[2023-03-22 12:56:02] [INFO ] Invariant cache hit.
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/289 places, 86/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 293 ms. Remains : 26/289 places, 86/310 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-08 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 44 place count 245 transition count 277
Iterating global reduction 1 with 33 rules applied. Total rules applied 77 place count 245 transition count 277
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 244 transition count 277
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 103 place count 219 transition count 252
Iterating global reduction 2 with 25 rules applied. Total rules applied 128 place count 219 transition count 252
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 217 transition count 252
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 153 place count 194 transition count 229
Iterating global reduction 3 with 23 rules applied. Total rules applied 176 place count 194 transition count 229
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 3 with 13 rules applied. Total rules applied 189 place count 181 transition count 229
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 204 place count 166 transition count 214
Iterating global reduction 4 with 15 rules applied. Total rules applied 219 place count 166 transition count 214
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 234 place count 151 transition count 199
Iterating global reduction 4 with 15 rules applied. Total rules applied 249 place count 151 transition count 199
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 263 place count 137 transition count 185
Iterating global reduction 4 with 14 rules applied. Total rules applied 277 place count 137 transition count 185
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 296 place count 118 transition count 166
Iterating global reduction 4 with 19 rules applied. Total rules applied 315 place count 118 transition count 166
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 354 place count 79 transition count 127
Iterating global reduction 4 with 39 rules applied. Total rules applied 393 place count 79 transition count 127
Applied a total of 393 rules in 20 ms. Remains 79 /289 variables (removed 210) and now considering 127/310 (removed 183) transitions.
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 81 transitions (discarded 46 similar events)
// Phase 1: matrix 81 rows 79 cols
[2023-03-22 12:56:02] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants in 61 ms returned [19, 35, 39, 43, 45, 54, 58, 62, 66, 70]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 63 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/289 places, 127/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 50 transition count 108
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 50 transition count 108
Applied a total of 38 rules in 0 ms. Remains 50 /69 variables (removed 19) and now considering 108/127 (removed 19) transitions.
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 50 cols
[2023-03-22 12:56:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
[2023-03-22 12:56:02] [INFO ] Invariant cache hit.
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/289 places, 108/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 50/289 places, 108/310 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s32 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-09 finished in 268 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) U (F(p1)&&X(X(G(p2))))))'
Support contains 4 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 278 transition count 310
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 246 transition count 278
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 246 transition count 278
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 245 transition count 278
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 100 place count 221 transition count 254
Iterating global reduction 2 with 24 rules applied. Total rules applied 124 place count 221 transition count 254
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 219 transition count 254
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 148 place count 197 transition count 232
Iterating global reduction 3 with 22 rules applied. Total rules applied 170 place count 197 transition count 232
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 181 place count 186 transition count 232
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 194 place count 173 transition count 219
Iterating global reduction 4 with 13 rules applied. Total rules applied 207 place count 173 transition count 219
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 220 place count 160 transition count 206
Iterating global reduction 4 with 13 rules applied. Total rules applied 233 place count 160 transition count 206
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 246 place count 147 transition count 193
Iterating global reduction 4 with 13 rules applied. Total rules applied 259 place count 147 transition count 193
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 277 place count 129 transition count 175
Iterating global reduction 4 with 18 rules applied. Total rules applied 295 place count 129 transition count 175
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 330 place count 94 transition count 140
Iterating global reduction 4 with 35 rules applied. Total rules applied 365 place count 94 transition count 140
Applied a total of 365 rules in 19 ms. Remains 94 /289 variables (removed 195) and now considering 140/310 (removed 170) transitions.
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 98 transitions (discarded 42 similar events)
// Phase 1: matrix 98 rows 94 cols
[2023-03-22 12:56:02] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-22 12:56:02] [INFO ] Implicit Places using invariants in 62 ms returned [24, 34, 39, 44, 52, 54, 57, 61, 65, 78, 83]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 65 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/289 places, 140/310 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 63 transition count 120
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 63 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 62 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 62 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 61 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 61 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 60 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 60 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 59 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 59 transition count 116
Applied a total of 48 rules in 2 ms. Remains 59 /83 variables (removed 24) and now considering 116/140 (removed 24) transitions.
[2023-03-22 12:56:02] [INFO ] Flow matrix only has 66 transitions (discarded 50 similar events)
// Phase 1: matrix 66 rows 59 cols
[2023-03-22 12:56:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:56:03] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 12:56:03] [INFO ] Flow matrix only has 66 transitions (discarded 50 similar events)
[2023-03-22 12:56:03] [INFO ] Invariant cache hit.
[2023-03-22 12:56:03] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/289 places, 116/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 59/289 places, 116/310 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 1 s26), p0:(LEQ 1 s41), p2:(GT s10 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-12 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(p1)||G(p2)))))'
Support contains 6 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 310/310 transitions.
Graph (complete) has 705 edges and 289 vertex of which 277 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 277 transition count 257
Reduce places removed 51 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 226 transition count 253
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 222 transition count 253
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 111 place count 222 transition count 236
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 145 place count 205 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 154 place count 196 transition count 227
Iterating global reduction 3 with 9 rules applied. Total rules applied 163 place count 196 transition count 227
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 195 place count 180 transition count 211
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 167 transition count 198
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 167 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 221 place count 167 transition count 197
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 166 transition count 197
Applied a total of 223 rules in 31 ms. Remains 166 /289 variables (removed 123) and now considering 197/310 (removed 113) transitions.
// Phase 1: matrix 197 rows 166 cols
[2023-03-22 12:56:03] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-22 12:56:03] [INFO ] Implicit Places using invariants in 112 ms returned [3, 9, 16, 23, 30, 41, 48, 51, 56, 63, 65, 67, 72, 79, 90, 97, 107, 117, 123, 130, 133, 138, 145]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 113 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/289 places, 197/310 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 143 transition count 190
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 136 transition count 190
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 67 place count 83 transition count 137
Iterating global reduction 0 with 53 rules applied. Total rules applied 120 place count 83 transition count 137
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 132 place count 71 transition count 125
Iterating global reduction 0 with 12 rules applied. Total rules applied 144 place count 71 transition count 125
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 157 place count 58 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 170 place count 58 transition count 112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 186 place count 50 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 49 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 49 transition count 103
Applied a total of 188 rules in 10 ms. Remains 49 /143 variables (removed 94) and now considering 103/197 (removed 94) transitions.
[2023-03-22 12:56:03] [INFO ] Flow matrix only has 56 transitions (discarded 47 similar events)
// Phase 1: matrix 56 rows 49 cols
[2023-03-22 12:56:03] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 12:56:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 12:56:03] [INFO ] Flow matrix only has 56 transitions (discarded 47 similar events)
[2023-03-22 12:56:03] [INFO ] Invariant cache hit.
[2023-03-22 12:56:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/289 places, 103/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 49/289 places, 103/310 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={1, 2} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={2} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={2} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s14 s34), p1:(LEQ s4 s25), p2:(LEQ s30 s37)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 542 steps with 41 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-15 finished in 618 ms.
All properties solved by simple procedures.
Total runtime 9778 ms.

BK_STOP 1679489766160

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S08C3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LeafsetExtension-PT-S08C3, 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 r229-tall-167856413300459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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