About the Execution of LoLa+red for LeafsetExtension-PT-S32C4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 858.231 | 20485.00 | 38774.00 | 355.20 | FFFFTFTFTFTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416200515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is LeafsetExtension-PT-S32C4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416200515
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 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 3.4M 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-S32C4-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S32C4-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679460449873
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:47:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:47:31] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2023-03-22 04:47:31] [INFO ] Transformed 5622 places.
[2023-03-22 04:47:31] [INFO ] Transformed 5449 transitions.
[2023-03-22 04:47:31] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 59 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1080 places and 0 transitions.
Iterating post reduction 0 with 1080 rules applied. Total rules applied 1080 place count 4542 transition count 5449
Discarding 1034 places :
Symmetric choice reduction at 1 with 1034 rule applications. Total rules 2114 place count 3508 transition count 4415
Iterating global reduction 1 with 1034 rules applied. Total rules applied 3148 place count 3508 transition count 4415
Discarding 962 places :
Symmetric choice reduction at 1 with 962 rule applications. Total rules 4110 place count 2546 transition count 3453
Iterating global reduction 1 with 962 rules applied. Total rules applied 5072 place count 2546 transition count 3453
Discarding 950 places :
Symmetric choice reduction at 1 with 950 rule applications. Total rules 6022 place count 1596 transition count 2503
Iterating global reduction 1 with 950 rules applied. Total rules applied 6972 place count 1596 transition count 2503
Discarding 36 places :
Implicit places reduction removed 36 places
Iterating post reduction 1 with 36 rules applied. Total rules applied 7008 place count 1560 transition count 2503
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7042 place count 1526 transition count 2469
Iterating global reduction 2 with 34 rules applied. Total rules applied 7076 place count 1526 transition count 2469
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 7110 place count 1492 transition count 2435
Iterating global reduction 2 with 34 rules applied. Total rules applied 7144 place count 1492 transition count 2435
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 7177 place count 1459 transition count 2402
Iterating global reduction 2 with 33 rules applied. Total rules applied 7210 place count 1459 transition count 2402
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 7243 place count 1426 transition count 2369
Iterating global reduction 2 with 33 rules applied. Total rules applied 7276 place count 1426 transition count 2369
Discarding 492 places :
Symmetric choice reduction at 2 with 492 rule applications. Total rules 7768 place count 934 transition count 1877
Iterating global reduction 2 with 492 rules applied. Total rules applied 8260 place count 934 transition count 1877
Applied a total of 8260 rules in 1913 ms. Remains 934 /5622 variables (removed 4688) and now considering 1877/5449 (removed 3572) transitions.
[2023-03-22 04:47:33] [INFO ] Flow matrix only has 1387 transitions (discarded 490 similar events)
// Phase 1: matrix 1387 rows 934 cols
[2023-03-22 04:47:33] [INFO ] Computed 67 place invariants in 44 ms
[2023-03-22 04:47:34] [INFO ] Implicit Places using invariants in 802 ms returned [52, 98, 104, 130, 153, 159, 163, 183, 189, 193, 244, 271, 276, 296, 349, 355, 384, 414, 441, 443, 446, 472, 498, 524, 552, 581, 585, 611, 633, 659, 710, 736, 758, 808, 835, 839, 866, 872, 876, 896]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1001 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 894/5622 places, 1877/5449 transitions.
Discarding 483 places :
Symmetric choice reduction at 0 with 483 rule applications. Total rules 483 place count 411 transition count 1394
Iterating global reduction 0 with 483 rules applied. Total rules applied 966 place count 411 transition count 1394
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 972 place count 405 transition count 1388
Iterating global reduction 0 with 6 rules applied. Total rules applied 978 place count 405 transition count 1388
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 984 place count 399 transition count 1382
Iterating global reduction 0 with 6 rules applied. Total rules applied 990 place count 399 transition count 1382
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 996 place count 393 transition count 1376
Iterating global reduction 0 with 6 rules applied. Total rules applied 1002 place count 393 transition count 1376
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 1008 place count 387 transition count 1370
Iterating global reduction 0 with 6 rules applied. Total rules applied 1014 place count 387 transition count 1370
Applied a total of 1014 rules in 62 ms. Remains 387 /894 variables (removed 507) and now considering 1370/1877 (removed 507) transitions.
[2023-03-22 04:47:34] [INFO ] Flow matrix only has 762 transitions (discarded 608 similar events)
// Phase 1: matrix 762 rows 387 cols
[2023-03-22 04:47:34] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-22 04:47:34] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-22 04:47:34] [INFO ] Flow matrix only has 762 transitions (discarded 608 similar events)
[2023-03-22 04:47:34] [INFO ] Invariant cache hit.
[2023-03-22 04:47:35] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 387/5622 places, 1370/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3716 ms. Remains : 387/5622 places, 1370/5449 transitions.
Support contains 59 out of 387 places after structural reductions.
[2023-03-22 04:47:35] [INFO ] Flatten gal took : 108 ms
[2023-03-22 04:47:35] [INFO ] Flatten gal took : 56 ms
[2023-03-22 04:47:35] [INFO ] Input system was already deterministic with 1370 transitions.
Support contains 56 out of 387 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 286 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 36) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-22 04:47:36] [INFO ] Flow matrix only has 762 transitions (discarded 608 similar events)
[2023-03-22 04:47:36] [INFO ] Invariant cache hit.
[2023-03-22 04:47:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 04:47:36] [INFO ] [Real]Absence check using 1 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 04:47:36] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-22 04:47:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 04:47:36] [INFO ] [Nat]Absence check using 1 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-22 04:47:37] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :3
[2023-03-22 04:47:37] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :17 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-22 04:47:37] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :3
Fused 20 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Graph (complete) has 1083 edges and 387 vertex of which 124 are kept as prefixes of interest. Removing 263 places using SCC suffix rule.3 ms
Discarding 263 places :
Also discarding 202 output transitions
Drop transitions removed 202 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 124 transition count 1128
Reduce places removed 12 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 16 rules applied. Total rules applied 57 place count 112 transition count 1124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 108 transition count 1124
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 61 place count 108 transition count 1115
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 79 place count 99 transition count 1115
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 94 transition count 1110
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 94 transition count 1110
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 103 place count 87 transition count 1103
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 136 place count 87 transition count 1070
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 169 place count 54 transition count 1070
Applied a total of 169 rules in 92 ms. Remains 54 /387 variables (removed 333) and now considering 1070/1370 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 54/387 places, 1070/1370 transitions.
Finished random walk after 2407 steps, including 367 resets, run visited all 3 properties in 27 ms. (steps per millisecond=89 )
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 387 stabilizing places and 1370 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 387 transition count 1370
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Graph (complete) has 2201 edges and 387 vertex of which 374 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.10 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 374 transition count 1288
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 293 transition count 1288
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 163 place count 293 transition count 1254
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 231 place count 259 transition count 1254
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 266 place count 224 transition count 1219
Iterating global reduction 2 with 35 rules applied. Total rules applied 301 place count 224 transition count 1219
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 310 place count 215 transition count 1210
Iterating global reduction 2 with 9 rules applied. Total rules applied 319 place count 215 transition count 1210
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 324 place count 210 transition count 1210
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 324 place count 210 transition count 1205
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 334 place count 205 transition count 1205
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 339 place count 200 transition count 1200
Iterating global reduction 3 with 5 rules applied. Total rules applied 344 place count 200 transition count 1200
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 349 place count 195 transition count 1195
Iterating global reduction 3 with 5 rules applied. Total rules applied 354 place count 195 transition count 1195
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 440 place count 152 transition count 1152
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 458 place count 134 transition count 1134
Iterating global reduction 3 with 18 rules applied. Total rules applied 476 place count 134 transition count 1134
Applied a total of 476 rules in 199 ms. Remains 134 /387 variables (removed 253) and now considering 1134/1370 (removed 236) transitions.
[2023-03-22 04:47:38] [INFO ] Flow matrix only has 417 transitions (discarded 717 similar events)
// Phase 1: matrix 417 rows 134 cols
[2023-03-22 04:47:38] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-22 04:47:38] [INFO ] Implicit Places using invariants in 231 ms returned [3, 7, 14, 26, 34, 35, 42, 46, 50, 63, 67, 80, 84, 85, 90, 94, 95, 104]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 247 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/387 places, 1134/1370 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 100 transition count 1118
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 100 transition count 1118
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 84 transition count 1102
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 84 transition count 1102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 82 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 80 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 80 transition count 1098
Applied a total of 72 rules in 66 ms. Remains 80 /116 variables (removed 36) and now considering 1098/1134 (removed 36) transitions.
[2023-03-22 04:47:38] [INFO ] Flow matrix only has 93 transitions (discarded 1005 similar events)
// Phase 1: matrix 93 rows 80 cols
[2023-03-22 04:47:38] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 04:47:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 04:47:38] [INFO ] Flow matrix only has 93 transitions (discarded 1005 similar events)
[2023-03-22 04:47:38] [INFO ] Invariant cache hit.
[2023-03-22 04:47:38] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/387 places, 1098/1370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 834 ms. Remains : 80/387 places, 1098/1370 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s54 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-03 finished in 1180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((p1||G(p2)))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 376 transition count 1370
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 62 place count 325 transition count 1319
Iterating global reduction 1 with 51 rules applied. Total rules applied 113 place count 325 transition count 1319
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 150 place count 288 transition count 1282
Iterating global reduction 1 with 37 rules applied. Total rules applied 187 place count 288 transition count 1282
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 192 place count 283 transition count 1282
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 224 place count 251 transition count 1250
Iterating global reduction 2 with 32 rules applied. Total rules applied 256 place count 251 transition count 1250
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 273 place count 234 transition count 1250
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 315 place count 192 transition count 1208
Iterating global reduction 3 with 42 rules applied. Total rules applied 357 place count 192 transition count 1208
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 379 place count 170 transition count 1186
Iterating global reduction 3 with 22 rules applied. Total rules applied 401 place count 170 transition count 1186
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 423 place count 148 transition count 1164
Iterating global reduction 3 with 22 rules applied. Total rules applied 445 place count 148 transition count 1164
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 467 place count 126 transition count 1142
Iterating global reduction 3 with 22 rules applied. Total rules applied 489 place count 126 transition count 1142
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 506 place count 109 transition count 1125
Iterating global reduction 3 with 17 rules applied. Total rules applied 523 place count 109 transition count 1125
Applied a total of 523 rules in 58 ms. Remains 109 /387 variables (removed 278) and now considering 1125/1370 (removed 245) transitions.
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 154 transitions (discarded 971 similar events)
// Phase 1: matrix 154 rows 109 cols
[2023-03-22 04:47:39] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-22 04:47:39] [INFO ] Implicit Places using invariants in 104 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/387 places, 1125/1370 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 106 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 106 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 105 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 105 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 104 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 104 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 103 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 103 transition count 1120
Applied a total of 10 rules in 15 ms. Remains 103 /108 variables (removed 5) and now considering 1120/1125 (removed 5) transitions.
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 134 transitions (discarded 986 similar events)
// Phase 1: matrix 134 rows 103 cols
[2023-03-22 04:47:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:47:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 134 transitions (discarded 986 similar events)
[2023-03-22 04:47:39] [INFO ] Invariant cache hit.
[2023-03-22 04:47:39] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/387 places, 1120/1370 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 103/387 places, 1120/1370 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s93 s56), p1:(GT 1 s35), p2:(GT s83 s64)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-05 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 374 transition count 1370
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 67 place count 320 transition count 1316
Iterating global reduction 1 with 54 rules applied. Total rules applied 121 place count 320 transition count 1316
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 161 place count 280 transition count 1276
Iterating global reduction 1 with 40 rules applied. Total rules applied 201 place count 280 transition count 1276
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 205 place count 276 transition count 1276
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 237 place count 244 transition count 1244
Iterating global reduction 2 with 32 rules applied. Total rules applied 269 place count 244 transition count 1244
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 288 place count 225 transition count 1244
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 332 place count 181 transition count 1200
Iterating global reduction 3 with 44 rules applied. Total rules applied 376 place count 181 transition count 1200
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 399 place count 158 transition count 1177
Iterating global reduction 3 with 23 rules applied. Total rules applied 422 place count 158 transition count 1177
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 445 place count 135 transition count 1154
Iterating global reduction 3 with 23 rules applied. Total rules applied 468 place count 135 transition count 1154
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 491 place count 112 transition count 1131
Iterating global reduction 3 with 23 rules applied. Total rules applied 514 place count 112 transition count 1131
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 533 place count 93 transition count 1112
Iterating global reduction 3 with 19 rules applied. Total rules applied 552 place count 93 transition count 1112
Applied a total of 552 rules in 34 ms. Remains 93 /387 variables (removed 294) and now considering 1112/1370 (removed 258) transitions.
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
// Phase 1: matrix 108 rows 93 cols
[2023-03-22 04:47:39] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:47:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
[2023-03-22 04:47:39] [INFO ] Invariant cache hit.
[2023-03-22 04:47:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-22 04:47:39] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
[2023-03-22 04:47:39] [INFO ] Invariant cache hit.
[2023-03-22 04:47:40] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/387 places, 1112/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 93/387 places, 1112/1370 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 363 ms.
Product exploration explored 100000 steps with 33333 reset in 293 ms.
Computed a total of 93 stabilizing places and 1112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 1112
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 : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-06 finished in 1483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 374 transition count 1370
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 66 place count 321 transition count 1317
Iterating global reduction 1 with 53 rules applied. Total rules applied 119 place count 321 transition count 1317
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 159 place count 281 transition count 1277
Iterating global reduction 1 with 40 rules applied. Total rules applied 199 place count 281 transition count 1277
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 204 place count 276 transition count 1277
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 238 place count 242 transition count 1243
Iterating global reduction 2 with 34 rules applied. Total rules applied 272 place count 242 transition count 1243
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 2 with 18 rules applied. Total rules applied 290 place count 224 transition count 1243
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 334 place count 180 transition count 1199
Iterating global reduction 3 with 44 rules applied. Total rules applied 378 place count 180 transition count 1199
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 401 place count 157 transition count 1176
Iterating global reduction 3 with 23 rules applied. Total rules applied 424 place count 157 transition count 1176
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 447 place count 134 transition count 1153
Iterating global reduction 3 with 23 rules applied. Total rules applied 470 place count 134 transition count 1153
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 493 place count 111 transition count 1130
Iterating global reduction 3 with 23 rules applied. Total rules applied 516 place count 111 transition count 1130
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 534 place count 93 transition count 1112
Iterating global reduction 3 with 18 rules applied. Total rules applied 552 place count 93 transition count 1112
Applied a total of 552 rules in 35 ms. Remains 93 /387 variables (removed 294) and now considering 1112/1370 (removed 258) transitions.
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 109 transitions (discarded 1003 similar events)
// Phase 1: matrix 109 rows 93 cols
[2023-03-22 04:47:41] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 04:47:41] [INFO ] Implicit Places using invariants in 92 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/387 places, 1112/1370 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 1111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 90 transition count 1110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 90 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 89 transition count 1109
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 89 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 88 transition count 1108
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 88 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 87 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 87 transition count 1107
Applied a total of 10 rules in 14 ms. Remains 87 /92 variables (removed 5) and now considering 1107/1112 (removed 5) transitions.
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
// Phase 1: matrix 89 rows 87 cols
[2023-03-22 04:47:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 04:47:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 89 transitions (discarded 1018 similar events)
[2023-03-22 04:47:41] [INFO ] Invariant cache hit.
[2023-03-22 04:47:41] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/387 places, 1107/1370 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 87/387 places, 1107/1370 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 s44), p0:(GT s40 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-07 finished in 477 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((p0&&X(G(p1)))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 377 transition count 1370
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 59 place count 328 transition count 1321
Iterating global reduction 1 with 49 rules applied. Total rules applied 108 place count 328 transition count 1321
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 146 place count 290 transition count 1283
Iterating global reduction 1 with 38 rules applied. Total rules applied 184 place count 290 transition count 1283
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 189 place count 285 transition count 1283
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 220 place count 254 transition count 1252
Iterating global reduction 2 with 31 rules applied. Total rules applied 251 place count 254 transition count 1252
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 2 with 16 rules applied. Total rules applied 267 place count 238 transition count 1252
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 306 place count 199 transition count 1213
Iterating global reduction 3 with 39 rules applied. Total rules applied 345 place count 199 transition count 1213
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 366 place count 178 transition count 1192
Iterating global reduction 3 with 21 rules applied. Total rules applied 387 place count 178 transition count 1192
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 408 place count 157 transition count 1171
Iterating global reduction 3 with 21 rules applied. Total rules applied 429 place count 157 transition count 1171
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 450 place count 136 transition count 1150
Iterating global reduction 3 with 21 rules applied. Total rules applied 471 place count 136 transition count 1150
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 487 place count 120 transition count 1134
Iterating global reduction 3 with 16 rules applied. Total rules applied 503 place count 120 transition count 1134
Applied a total of 503 rules in 35 ms. Remains 120 /387 variables (removed 267) and now considering 1134/1370 (removed 236) transitions.
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 164 transitions (discarded 970 similar events)
// Phase 1: matrix 164 rows 120 cols
[2023-03-22 04:47:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 04:47:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 164 transitions (discarded 970 similar events)
[2023-03-22 04:47:41] [INFO ] Invariant cache hit.
[2023-03-22 04:47:41] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-22 04:47:41] [INFO ] Flow matrix only has 164 transitions (discarded 970 similar events)
[2023-03-22 04:47:41] [INFO ] Invariant cache hit.
[2023-03-22 04:47:42] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/387 places, 1134/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 120/387 places, 1134/1370 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LEQ s102 s47) (LEQ s5 s81)), p1:(LEQ s26 s101)], 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 198 steps with 5 reset in 5 ms.
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-09 finished in 800 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(((p0 U X((p1&&G(F(p1))))) U !p0)))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 374 transition count 1370
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 64 place count 323 transition count 1319
Iterating global reduction 1 with 51 rules applied. Total rules applied 115 place count 323 transition count 1319
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 154 place count 284 transition count 1280
Iterating global reduction 1 with 39 rules applied. Total rules applied 193 place count 284 transition count 1280
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 198 place count 279 transition count 1280
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 231 place count 246 transition count 1247
Iterating global reduction 2 with 33 rules applied. Total rules applied 264 place count 246 transition count 1247
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 281 place count 229 transition count 1247
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 323 place count 187 transition count 1205
Iterating global reduction 3 with 42 rules applied. Total rules applied 365 place count 187 transition count 1205
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 387 place count 165 transition count 1183
Iterating global reduction 3 with 22 rules applied. Total rules applied 409 place count 165 transition count 1183
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 431 place count 143 transition count 1161
Iterating global reduction 3 with 22 rules applied. Total rules applied 453 place count 143 transition count 1161
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 475 place count 121 transition count 1139
Iterating global reduction 3 with 22 rules applied. Total rules applied 497 place count 121 transition count 1139
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 514 place count 104 transition count 1122
Iterating global reduction 3 with 17 rules applied. Total rules applied 531 place count 104 transition count 1122
Applied a total of 531 rules in 62 ms. Remains 104 /387 variables (removed 283) and now considering 1122/1370 (removed 248) transitions.
[2023-03-22 04:47:42] [INFO ] Flow matrix only has 136 transitions (discarded 986 similar events)
// Phase 1: matrix 136 rows 104 cols
[2023-03-22 04:47:42] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 04:47:42] [INFO ] Implicit Places using invariants in 165 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/387 places, 1122/1370 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 99 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 98 transition count 1117
Applied a total of 10 rules in 40 ms. Remains 98 /103 variables (removed 5) and now considering 1117/1122 (removed 5) transitions.
[2023-03-22 04:47:42] [INFO ] Flow matrix only has 116 transitions (discarded 1001 similar events)
// Phase 1: matrix 116 rows 98 cols
[2023-03-22 04:47:42] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 04:47:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 04:47:42] [INFO ] Flow matrix only has 116 transitions (discarded 1001 similar events)
[2023-03-22 04:47:42] [INFO ] Invariant cache hit.
[2023-03-22 04:47:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/387 places, 1117/1370 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 560 ms. Remains : 98/387 places, 1117/1370 transitions.
Stuttering acceptance computed with spot in 265 ms :[p0, p0, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT s70 s36), p1:(LEQ s28 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 98 stabilizing places and 1117 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 1117
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 (NOT p0) p1), (X (NOT p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 308 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-10 finished in 1848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Graph (complete) has 2201 edges and 387 vertex of which 373 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 373 transition count 1287
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 291 transition count 1287
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 165 place count 291 transition count 1254
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 231 place count 258 transition count 1254
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 265 place count 224 transition count 1220
Iterating global reduction 2 with 34 rules applied. Total rules applied 299 place count 224 transition count 1220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 308 place count 215 transition count 1211
Iterating global reduction 2 with 9 rules applied. Total rules applied 317 place count 215 transition count 1211
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 322 place count 210 transition count 1211
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 322 place count 210 transition count 1206
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 332 place count 205 transition count 1206
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 337 place count 200 transition count 1201
Iterating global reduction 3 with 5 rules applied. Total rules applied 342 place count 200 transition count 1201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 347 place count 195 transition count 1196
Iterating global reduction 3 with 5 rules applied. Total rules applied 352 place count 195 transition count 1196
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 440 place count 151 transition count 1152
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 459 place count 132 transition count 1133
Iterating global reduction 3 with 19 rules applied. Total rules applied 478 place count 132 transition count 1133
Applied a total of 478 rules in 79 ms. Remains 132 /387 variables (removed 255) and now considering 1133/1370 (removed 237) transitions.
[2023-03-22 04:47:44] [INFO ] Flow matrix only has 416 transitions (discarded 717 similar events)
// Phase 1: matrix 416 rows 132 cols
[2023-03-22 04:47:44] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-22 04:47:44] [INFO ] Implicit Places using invariants in 182 ms returned [3, 7, 14, 27, 35, 36, 43, 47, 51, 63, 67, 73, 78, 82, 83, 88, 92, 93, 102]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 187 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/387 places, 1133/1370 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 96 transition count 1116
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 96 transition count 1116
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 79 transition count 1099
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 79 transition count 1099
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 75 transition count 1095
Applied a total of 76 rules in 39 ms. Remains 75 /113 variables (removed 38) and now considering 1095/1133 (removed 38) transitions.
[2023-03-22 04:47:44] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
// Phase 1: matrix 75 rows 75 cols
[2023-03-22 04:47:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:47:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-22 04:47:44] [INFO ] Flow matrix only has 75 transitions (discarded 1020 similar events)
[2023-03-22 04:47:44] [INFO ] Invariant cache hit.
[2023-03-22 04:47:44] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/387 places, 1095/1370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 592 ms. Remains : 75/387 places, 1095/1370 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s51 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7453 reset in 296 ms.
Product exploration explored 100000 steps with 7463 reset in 364 ms.
Computed a total of 75 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 1095
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 : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-12 finished in 1623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 375 transition count 1370
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 62 place count 325 transition count 1320
Iterating global reduction 1 with 50 rules applied. Total rules applied 112 place count 325 transition count 1320
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 149 place count 288 transition count 1283
Iterating global reduction 1 with 37 rules applied. Total rules applied 186 place count 288 transition count 1283
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 190 place count 284 transition count 1283
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 220 place count 254 transition count 1253
Iterating global reduction 2 with 30 rules applied. Total rules applied 250 place count 254 transition count 1253
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 2 with 16 rules applied. Total rules applied 266 place count 238 transition count 1253
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 305 place count 199 transition count 1214
Iterating global reduction 3 with 39 rules applied. Total rules applied 344 place count 199 transition count 1214
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 363 place count 180 transition count 1195
Iterating global reduction 3 with 19 rules applied. Total rules applied 382 place count 180 transition count 1195
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 401 place count 161 transition count 1176
Iterating global reduction 3 with 19 rules applied. Total rules applied 420 place count 161 transition count 1176
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 439 place count 142 transition count 1157
Iterating global reduction 3 with 19 rules applied. Total rules applied 458 place count 142 transition count 1157
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 473 place count 127 transition count 1142
Iterating global reduction 3 with 15 rules applied. Total rules applied 488 place count 127 transition count 1142
Applied a total of 488 rules in 43 ms. Remains 127 /387 variables (removed 260) and now considering 1142/1370 (removed 228) transitions.
[2023-03-22 04:47:45] [INFO ] Flow matrix only has 203 transitions (discarded 939 similar events)
// Phase 1: matrix 203 rows 127 cols
[2023-03-22 04:47:45] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 04:47:45] [INFO ] Implicit Places using invariants in 120 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/387 places, 1142/1370 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 1141
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 124 transition count 1140
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 124 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 123 transition count 1139
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 123 transition count 1139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 122 transition count 1138
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 122 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 121 transition count 1137
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 121 transition count 1137
Applied a total of 10 rules in 13 ms. Remains 121 /126 variables (removed 5) and now considering 1137/1142 (removed 5) transitions.
[2023-03-22 04:47:45] [INFO ] Flow matrix only has 183 transitions (discarded 954 similar events)
// Phase 1: matrix 183 rows 121 cols
[2023-03-22 04:47:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 04:47:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 04:47:46] [INFO ] Flow matrix only has 183 transitions (discarded 954 similar events)
[2023-03-22 04:47:46] [INFO ] Invariant cache hit.
[2023-03-22 04:47:46] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/387 places, 1137/1370 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 121/387 places, 1137/1370 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s106 s51), p0:(OR (LEQ s113 s12) (LEQ s69 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33239 reset in 306 ms.
Product exploration explored 100000 steps with 33282 reset in 294 ms.
Computed a total of 121 stabilizing places and 1137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 1137
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), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-13 finished in 1731 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((p0||G(p1))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1370/1370 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 375 transition count 1370
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 61 place count 326 transition count 1321
Iterating global reduction 1 with 49 rules applied. Total rules applied 110 place count 326 transition count 1321
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 146 place count 290 transition count 1285
Iterating global reduction 1 with 36 rules applied. Total rules applied 182 place count 290 transition count 1285
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 187 place count 285 transition count 1285
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 216 place count 256 transition count 1256
Iterating global reduction 2 with 29 rules applied. Total rules applied 245 place count 256 transition count 1256
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 259 place count 242 transition count 1256
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 294 place count 207 transition count 1221
Iterating global reduction 3 with 35 rules applied. Total rules applied 329 place count 207 transition count 1221
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 348 place count 188 transition count 1202
Iterating global reduction 3 with 19 rules applied. Total rules applied 367 place count 188 transition count 1202
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 386 place count 169 transition count 1183
Iterating global reduction 3 with 19 rules applied. Total rules applied 405 place count 169 transition count 1183
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 424 place count 150 transition count 1164
Iterating global reduction 3 with 19 rules applied. Total rules applied 443 place count 150 transition count 1164
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 457 place count 136 transition count 1150
Iterating global reduction 3 with 14 rules applied. Total rules applied 471 place count 136 transition count 1150
Applied a total of 471 rules in 35 ms. Remains 136 /387 variables (removed 251) and now considering 1150/1370 (removed 220) transitions.
[2023-03-22 04:47:47] [INFO ] Flow matrix only has 211 transitions (discarded 939 similar events)
// Phase 1: matrix 211 rows 136 cols
[2023-03-22 04:47:47] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-22 04:47:47] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-22 04:47:47] [INFO ] Flow matrix only has 211 transitions (discarded 939 similar events)
[2023-03-22 04:47:47] [INFO ] Invariant cache hit.
[2023-03-22 04:47:47] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-22 04:47:47] [INFO ] Flow matrix only has 211 transitions (discarded 939 similar events)
[2023-03-22 04:47:47] [INFO ] Invariant cache hit.
[2023-03-22 04:47:48] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/387 places, 1150/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 136/387 places, 1150/1370 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LEQ s50 s12) (LEQ s99 s67)), p0:(LEQ s78 s110)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 136 stabilizing places and 1150 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 1150
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), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C4-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C4-LTLCardinality-14 finished in 1644 ms.
All properties solved by simple procedures.
Total runtime 17911 ms.
ITS solved all properties within timeout
BK_STOP 1679460470358
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-S32C4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is LeafsetExtension-PT-S32C4, 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 r231-tall-167856416200515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C4.tgz
mv LeafsetExtension-PT-S32C4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;