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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 11K Feb 25 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 905K 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-S16C2-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679491553955

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-S16C2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 13:25:55] [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 13:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:25:55] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-22 13:25:55] [INFO ] Transformed 1542 places.
[2023-03-22 13:25:55] [INFO ] Transformed 1449 transitions.
[2023-03-22 13:25:55] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 1254 transition count 1449
Discarding 256 places :
Symmetric choice reduction at 1 with 256 rule applications. Total rules 544 place count 998 transition count 1193
Iterating global reduction 1 with 256 rules applied. Total rules applied 800 place count 998 transition count 1193
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 1020 place count 778 transition count 973
Iterating global reduction 1 with 220 rules applied. Total rules applied 1240 place count 778 transition count 973
Discarding 214 places :
Symmetric choice reduction at 1 with 214 rule applications. Total rules 1454 place count 564 transition count 759
Iterating global reduction 1 with 214 rules applied. Total rules applied 1668 place count 564 transition count 759
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 1684 place count 548 transition count 759
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1697 place count 535 transition count 746
Iterating global reduction 2 with 13 rules applied. Total rules applied 1710 place count 535 transition count 746
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1723 place count 522 transition count 733
Iterating global reduction 2 with 13 rules applied. Total rules applied 1736 place count 522 transition count 733
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1749 place count 509 transition count 720
Iterating global reduction 2 with 13 rules applied. Total rules applied 1762 place count 509 transition count 720
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1775 place count 496 transition count 707
Iterating global reduction 2 with 13 rules applied. Total rules applied 1788 place count 496 transition count 707
Discarding 89 places :
Symmetric choice reduction at 2 with 89 rule applications. Total rules 1877 place count 407 transition count 618
Iterating global reduction 2 with 89 rules applied. Total rules applied 1966 place count 407 transition count 618
Applied a total of 1966 rules in 372 ms. Remains 407 /1542 variables (removed 1135) and now considering 618/1449 (removed 831) transitions.
[2023-03-22 13:25:56] [INFO ] Flow matrix only has 529 transitions (discarded 89 similar events)
// Phase 1: matrix 529 rows 407 cols
[2023-03-22 13:25:56] [INFO ] Computed 38 place invariants in 33 ms
[2023-03-22 13:25:56] [INFO ] Implicit Places using invariants in 420 ms returned [18, 33, 62, 82, 99, 118, 138, 177, 179, 203, 207, 230, 251, 272, 278, 290, 324, 343, 362]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 449 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 388/1542 places, 618/1449 transitions.
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 117 place count 271 transition count 501
Iterating global reduction 0 with 117 rules applied. Total rules applied 234 place count 271 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 237 place count 268 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 240 place count 268 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 265 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 265 transition count 495
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 249 place count 262 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 252 place count 262 transition count 492
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 256 transition count 486
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 256 transition count 486
Applied a total of 264 rules in 33 ms. Remains 256 /388 variables (removed 132) and now considering 486/618 (removed 132) transitions.
[2023-03-22 13:25:56] [INFO ] Flow matrix only has 369 transitions (discarded 117 similar events)
// Phase 1: matrix 369 rows 256 cols
[2023-03-22 13:25:56] [INFO ] Computed 19 place invariants in 11 ms
[2023-03-22 13:25:56] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 13:25:56] [INFO ] Flow matrix only has 369 transitions (discarded 117 similar events)
[2023-03-22 13:25:56] [INFO ] Invariant cache hit.
[2023-03-22 13:25:57] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 256/1542 places, 486/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1232 ms. Remains : 256/1542 places, 486/1449 transitions.
Support contains 38 out of 256 places after structural reductions.
[2023-03-22 13:25:57] [INFO ] Flatten gal took : 52 ms
[2023-03-22 13:25:57] [INFO ] Flatten gal took : 25 ms
[2023-03-22 13:25:57] [INFO ] Input system was already deterministic with 486 transitions.
Support contains 36 out of 256 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 536 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 13:25:57] [INFO ] Flow matrix only has 369 transitions (discarded 117 similar events)
[2023-03-22 13:25:57] [INFO ] Invariant cache hit.
[2023-03-22 13:25:58] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 13:25:58] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 256 stabilizing places and 486 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 256 transition count 486
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-S16C2-LTLCardinality-03 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(F(p0)))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 251 transition count 486
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 34 place count 222 transition count 457
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 222 transition count 457
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 85 place count 200 transition count 435
Iterating global reduction 1 with 22 rules applied. Total rules applied 107 place count 200 transition count 435
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 198 transition count 435
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 128 place count 179 transition count 416
Iterating global reduction 2 with 19 rules applied. Total rules applied 147 place count 179 transition count 416
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 159 place count 167 transition count 416
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 187 place count 139 transition count 388
Iterating global reduction 3 with 28 rules applied. Total rules applied 215 place count 139 transition count 388
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 231 place count 123 transition count 372
Iterating global reduction 3 with 16 rules applied. Total rules applied 247 place count 123 transition count 372
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 261 place count 109 transition count 358
Iterating global reduction 3 with 14 rules applied. Total rules applied 275 place count 109 transition count 358
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 291 place count 93 transition count 342
Iterating global reduction 3 with 16 rules applied. Total rules applied 307 place count 93 transition count 342
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 330 place count 70 transition count 319
Iterating global reduction 3 with 23 rules applied. Total rules applied 353 place count 70 transition count 319
Applied a total of 353 rules in 20 ms. Remains 70 /256 variables (removed 186) and now considering 319/486 (removed 167) transitions.
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 77 transitions (discarded 242 similar events)
// Phase 1: matrix 77 rows 70 cols
[2023-03-22 13:25:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants in 54 ms returned [27, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/256 places, 319/486 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 315
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 315
Applied a total of 8 rules in 2 ms. Remains 64 /68 variables (removed 4) and now considering 315/319 (removed 4) transitions.
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 72 transitions (discarded 243 similar events)
// Phase 1: matrix 72 rows 64 cols
[2023-03-22 13:25:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 72 transitions (discarded 243 similar events)
[2023-03-22 13:25:58] [INFO ] Invariant cache hit.
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/256 places, 315/486 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 64/256 places, 315/486 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s37 s31)], 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][false, false]]
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-01 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 252 transition count 486
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 34 place count 222 transition count 456
Iterating global reduction 1 with 30 rules applied. Total rules applied 64 place count 222 transition count 456
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 87 place count 199 transition count 433
Iterating global reduction 1 with 23 rules applied. Total rules applied 110 place count 199 transition count 433
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 197 transition count 433
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 131 place count 178 transition count 414
Iterating global reduction 2 with 19 rules applied. Total rules applied 150 place count 178 transition count 414
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 162 place count 166 transition count 414
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 190 place count 138 transition count 386
Iterating global reduction 3 with 28 rules applied. Total rules applied 218 place count 138 transition count 386
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 234 place count 122 transition count 370
Iterating global reduction 3 with 16 rules applied. Total rules applied 250 place count 122 transition count 370
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 264 place count 108 transition count 356
Iterating global reduction 3 with 14 rules applied. Total rules applied 278 place count 108 transition count 356
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 294 place count 92 transition count 340
Iterating global reduction 3 with 16 rules applied. Total rules applied 310 place count 92 transition count 340
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 333 place count 69 transition count 317
Iterating global reduction 3 with 23 rules applied. Total rules applied 356 place count 69 transition count 317
Applied a total of 356 rules in 25 ms. Remains 69 /256 variables (removed 187) and now considering 317/486 (removed 169) transitions.
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 74 transitions (discarded 243 similar events)
// Phase 1: matrix 74 rows 69 cols
[2023-03-22 13:25:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants in 60 ms returned [38, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/256 places, 317/486 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 313
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 313
Applied a total of 8 rules in 2 ms. Remains 63 /67 variables (removed 4) and now considering 313/317 (removed 4) transitions.
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
// Phase 1: matrix 69 rows 63 cols
[2023-03-22 13:25:58] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 13:25:58] [INFO ] Flow matrix only has 69 transitions (discarded 244 similar events)
[2023-03-22 13:25:58] [INFO ] Invariant cache hit.
[2023-03-22 13:25:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/256 places, 313/486 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 63/256 places, 313/486 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s27)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-04 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Graph (complete) has 910 edges and 256 vertex of which 250 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 250 transition count 442
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 207 transition count 442
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 87 place count 207 transition count 422
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 127 place count 187 transition count 422
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 172 transition count 407
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 172 transition count 407
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 169 transition count 404
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 169 transition count 404
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 168 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 168 transition count 403
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 166 place count 167 transition count 403
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 164 transition count 400
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 164 transition count 400
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 163 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 163 transition count 399
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 161 transition count 397
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 161 transition count 397
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 264 place count 118 transition count 354
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 277 place count 105 transition count 341
Iterating global reduction 3 with 13 rules applied. Total rules applied 290 place count 105 transition count 341
Applied a total of 290 rules in 74 ms. Remains 105 /256 variables (removed 151) and now considering 341/486 (removed 145) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 200 transitions (discarded 141 similar events)
// Phase 1: matrix 200 rows 105 cols
[2023-03-22 13:25:59] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 71 ms returned [2, 11, 16, 23, 28, 34, 36, 51, 56, 63, 73, 78, 83, 86]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 73 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/256 places, 341/486 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 80 transition count 330
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 80 transition count 330
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 70 transition count 320
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 70 transition count 320
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 61 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 61 transition count 311
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 76 place count 53 transition count 303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 51 transition count 301
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 51 transition count 301
Applied a total of 80 rules in 19 ms. Remains 51 /91 variables (removed 40) and now considering 301/341 (removed 40) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
// Phase 1: matrix 63 rows 51 cols
[2023-03-22 13:25:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
[2023-03-22 13:25:59] [INFO ] Invariant cache hit.
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/256 places, 301/486 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 282 ms. Remains : 51/256 places, 301/486 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s22 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-07 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Graph (complete) has 910 edges and 256 vertex of which 251 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 251 transition count 442
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 208 transition count 442
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 87 place count 208 transition count 423
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 125 place count 189 transition count 423
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 141 place count 173 transition count 407
Iterating global reduction 2 with 16 rules applied. Total rules applied 157 place count 173 transition count 407
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 169 transition count 403
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 169 transition count 403
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 167 transition count 403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 167 place count 167 transition count 401
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 165 transition count 401
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 161 transition count 397
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 161 transition count 397
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 159 transition count 395
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 159 transition count 395
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 187 place count 155 transition count 391
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 155 transition count 391
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 273 place count 114 transition count 350
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 285 place count 102 transition count 338
Iterating global reduction 3 with 12 rules applied. Total rules applied 297 place count 102 transition count 338
Applied a total of 297 rules in 53 ms. Remains 102 /256 variables (removed 154) and now considering 338/486 (removed 148) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 189 transitions (discarded 149 similar events)
// Phase 1: matrix 189 rows 102 cols
[2023-03-22 13:25:59] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 72 ms returned [2, 11, 16, 23, 28, 34, 36, 51, 56, 71, 76, 81, 84]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 74 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/256 places, 338/486 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 79 transition count 328
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 79 transition count 328
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 70 transition count 319
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 70 transition count 319
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 62 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 62 transition count 311
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 54 transition count 303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 52 transition count 301
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 52 transition count 301
Applied a total of 74 rules in 15 ms. Remains 52 /89 variables (removed 37) and now considering 301/338 (removed 37) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
// Phase 1: matrix 63 rows 52 cols
[2023-03-22 13:25:59] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
[2023-03-22 13:25:59] [INFO ] Invariant cache hit.
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/256 places, 301/486 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 52/256 places, 301/486 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s37 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1043 steps with 113 reset in 5 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-10 finished in 309 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 U p1)||G((p2 U p1)))&&((p0 U p1)||(p1 U G(p2)))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Graph (complete) has 910 edges and 256 vertex of which 251 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 251 transition count 442
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 208 transition count 442
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 87 place count 208 transition count 424
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 123 place count 190 transition count 424
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 138 place count 175 transition count 409
Iterating global reduction 2 with 15 rules applied. Total rules applied 153 place count 175 transition count 409
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 170 transition count 404
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 170 transition count 404
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 165 place count 168 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 165 place count 168 transition count 402
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 166 transition count 402
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 162 transition count 398
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 162 transition count 398
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 160 transition count 396
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 160 transition count 396
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 156 transition count 392
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 156 transition count 392
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 269 place count 116 transition count 352
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 281 place count 104 transition count 340
Iterating global reduction 3 with 12 rules applied. Total rules applied 293 place count 104 transition count 340
Applied a total of 293 rules in 45 ms. Remains 104 /256 variables (removed 152) and now considering 340/486 (removed 146) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 192 transitions (discarded 148 similar events)
// Phase 1: matrix 192 rows 104 cols
[2023-03-22 13:25:59] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 77 ms returned [2, 11, 16, 23, 28, 34, 46, 54, 61, 68, 73, 78, 83, 86]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 79 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/256 places, 340/486 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 89 transition count 339
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 79 transition count 329
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 79 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 70 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 70 transition count 320
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 48 place count 62 transition count 312
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 62 transition count 312
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 72 place count 54 transition count 304
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 52 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 52 transition count 302
Applied a total of 76 rules in 14 ms. Remains 52 /90 variables (removed 38) and now considering 302/340 (removed 38) transitions.
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 65 transitions (discarded 237 similar events)
// Phase 1: matrix 65 rows 52 cols
[2023-03-22 13:25:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 13:25:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 13:25:59] [INFO ] Flow matrix only has 65 transitions (discarded 237 similar events)
[2023-03-22 13:25:59] [INFO ] Invariant cache hit.
[2023-03-22 13:26:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/256 places, 302/486 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 52/256 places, 302/486 transitions.
Stuttering acceptance computed with spot in 734 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0 p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 2} source=0 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=0 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={1, 2} source=0 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=0 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(OR p1 (AND p0 p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=2 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={1, 2} source=2 dest: 6}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={1, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={1, 2} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 2} source=7 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s31 s19), p0:(LEQ 1 s23), p2:(LEQ 2 s48)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 11071 reset in 275 ms.
Product exploration explored 100000 steps with 11097 reset in 272 ms.
Computed a total of 52 stabilizing places and 302 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 302
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 (NOT p0) (NOT p2)), (X (OR p1 p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR p1 (AND p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (OR p1 p0 p2))), (X (X (NOT (OR p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 16 factoid took 676 ms. Reduced automaton from 8 states, 50 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-12 finished in 2287 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 p1) U X(p2))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 486/486 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 253 transition count 486
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 228 transition count 461
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 228 transition count 461
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 209 transition count 442
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 209 transition count 442
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 207 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 109 place count 191 transition count 426
Iterating global reduction 2 with 16 rules applied. Total rules applied 125 place count 191 transition count 426
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 182 transition count 426
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 157 place count 159 transition count 403
Iterating global reduction 3 with 23 rules applied. Total rules applied 180 place count 159 transition count 403
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 193 place count 146 transition count 390
Iterating global reduction 3 with 13 rules applied. Total rules applied 206 place count 146 transition count 390
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 217 place count 135 transition count 379
Iterating global reduction 3 with 11 rules applied. Total rules applied 228 place count 135 transition count 379
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 241 place count 122 transition count 366
Iterating global reduction 3 with 13 rules applied. Total rules applied 254 place count 122 transition count 366
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 271 place count 105 transition count 349
Iterating global reduction 3 with 17 rules applied. Total rules applied 288 place count 105 transition count 349
Applied a total of 288 rules in 23 ms. Remains 105 /256 variables (removed 151) and now considering 349/486 (removed 137) transitions.
[2023-03-22 13:26:02] [INFO ] Flow matrix only has 132 transitions (discarded 217 similar events)
// Phase 1: matrix 132 rows 105 cols
[2023-03-22 13:26:02] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 13:26:02] [INFO ] Implicit Places using invariants in 55 ms returned [48, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/256 places, 349/486 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 343
Applied a total of 12 rules in 1 ms. Remains 97 /103 variables (removed 6) and now considering 343/349 (removed 6) transitions.
[2023-03-22 13:26:02] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
// Phase 1: matrix 125 rows 97 cols
[2023-03-22 13:26:02] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 13:26:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 13:26:02] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:02] [INFO ] Invariant cache hit.
[2023-03-22 13:26:02] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/256 places, 343/486 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 97/256 places, 343/486 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s60 s80), p0:(LEQ s66 s28), p2:(LEQ s23 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33309 reset in 272 ms.
Product exploration explored 100000 steps with 33368 reset in 239 ms.
Computed a total of 97 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 97 transition count 343
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 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 828 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 522 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 13:26:04] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:04] [INFO ] Invariant cache hit.
[2023-03-22 13:26:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:26:04] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 13:26:04] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 13:26:04] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 13:26:04] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 343/343 transitions.
Graph (complete) has 216 edges and 97 vertex of which 78 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 78 transition count 316
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 68 transition count 312
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 64 transition count 312
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 35 place count 64 transition count 306
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 47 place count 58 transition count 306
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 3 with 16 rules applied. Total rules applied 63 place count 50 transition count 298
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 80 place count 50 transition count 281
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 97 place count 33 transition count 281
Applied a total of 97 rules in 17 ms. Remains 33 /97 variables (removed 64) and now considering 281/343 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 33/97 places, 281/343 transitions.
Finished random walk after 4258 steps, including 1274 resets, run visited all 3 properties in 42 ms. (steps per millisecond=101 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 16 factoid took 1490 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 343/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-22 13:26:06] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:06] [INFO ] Invariant cache hit.
[2023-03-22 13:26:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-22 13:26:06] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:06] [INFO ] Invariant cache hit.
[2023-03-22 13:26:06] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-22 13:26:06] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:06] [INFO ] Invariant cache hit.
[2023-03-22 13:26:06] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 97/97 places, 343/343 transitions.
Computed a total of 97 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 97 transition count 343
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 p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 523 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 13:26:07] [INFO ] Flow matrix only has 125 transitions (discarded 218 similar events)
[2023-03-22 13:26:07] [INFO ] Invariant cache hit.
[2023-03-22 13:26:07] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:26:07] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 13:26:07] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:26:07] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 13:26:07] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 343/343 transitions.
Graph (complete) has 216 edges and 97 vertex of which 58 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 58 transition count 287
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 48 place count 51 transition count 276
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 48 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 51 place count 48 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 45 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 42 transition count 270
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 42 transition count 254
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 95 place count 26 transition count 254
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 102 place count 26 transition count 254
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 25 transition count 254
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 25 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 24 transition count 253
Applied a total of 105 rules in 19 ms. Remains 24 /97 variables (removed 73) and now considering 253/343 (removed 90) transitions.
[2023-03-22 13:26:07] [INFO ] Flow matrix only has 39 transitions (discarded 214 similar events)
// Phase 1: matrix 39 rows 24 cols
[2023-03-22 13:26:07] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 13:26:08] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 24/97 places, 253/343 transitions.
Finished random walk after 896 steps, including 291 resets, run visited all 2 properties in 12 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 709 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33360 reset in 228 ms.
Product exploration explored 100000 steps with 33338 reset in 233 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 343/343 transitions.
Graph (complete) has 513 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 96 transition count 342
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 12 place count 96 transition count 346
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 96 transition count 346
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 96 transition count 346
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 83 transition count 333
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 83 transition count 333
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 57 rules in 18 ms. Remains 83 /97 variables (removed 14) and now considering 333/343 (removed 10) transitions.
[2023-03-22 13:26:10] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 13:26:10] [INFO ] Flow matrix only has 113 transitions (discarded 220 similar events)
// Phase 1: matrix 113 rows 83 cols
[2023-03-22 13:26:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 13:26:10] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/97 places, 333/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 83/97 places, 333/343 transitions.
Built C files in :
/tmp/ltsmin17227469901037023931
[2023-03-22 13:26:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17227469901037023931
Running compilation step : cd /tmp/ltsmin17227469901037023931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 871 ms.
Running link step : cd /tmp/ltsmin17227469901037023931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17227469901037023931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2110718868027500056.hoa' '--buchi-type=spotba'
LTSmin run took 422 ms.
FORMULA LeafsetExtension-PT-S16C2-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C2-LTLCardinality-13 finished in 9720 ms.
All properties solved by simple procedures.
Total runtime 16325 ms.

BK_STOP 1679491576048

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-S16C2"
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-S16C2, 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-167856413300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S16C2.tgz
mv LeafsetExtension-PT-S16C2 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 ;