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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K 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 3.8K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 905K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679458893154

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-S16C3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:21:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:21:34] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-22 04:21:34] [INFO ] Transformed 1542 places.
[2023-03-22 04:21:34] [INFO ] Transformed 1449 transitions.
[2023-03-22 04:21:34] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 283 places and 0 transitions.
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1259 transition count 1449
Discarding 257 places :
Symmetric choice reduction at 1 with 257 rule applications. Total rules 540 place count 1002 transition count 1192
Iterating global reduction 1 with 257 rules applied. Total rules applied 797 place count 1002 transition count 1192
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 1009 place count 790 transition count 980
Iterating global reduction 1 with 212 rules applied. Total rules applied 1221 place count 790 transition count 980
Discarding 204 places :
Symmetric choice reduction at 1 with 204 rule applications. Total rules 1425 place count 586 transition count 776
Iterating global reduction 1 with 204 rules applied. Total rules applied 1629 place count 586 transition count 776
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 1 with 14 rules applied. Total rules applied 1643 place count 572 transition count 776
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1655 place count 560 transition count 764
Iterating global reduction 2 with 12 rules applied. Total rules applied 1667 place count 560 transition count 764
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1678 place count 549 transition count 753
Iterating global reduction 2 with 11 rules applied. Total rules applied 1689 place count 549 transition count 753
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1700 place count 538 transition count 742
Iterating global reduction 2 with 11 rules applied. Total rules applied 1711 place count 538 transition count 742
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1722 place count 527 transition count 731
Iterating global reduction 2 with 11 rules applied. Total rules applied 1733 place count 527 transition count 731
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1802 place count 458 transition count 662
Iterating global reduction 2 with 69 rules applied. Total rules applied 1871 place count 458 transition count 662
Applied a total of 1871 rules in 357 ms. Remains 458 /1542 variables (removed 1084) and now considering 662/1449 (removed 787) transitions.
[2023-03-22 04:21:35] [INFO ] Flow matrix only has 593 transitions (discarded 69 similar events)
// Phase 1: matrix 593 rows 458 cols
[2023-03-22 04:21:35] [INFO ] Computed 44 place invariants in 40 ms
[2023-03-22 04:21:35] [INFO ] Implicit Places using invariants in 514 ms returned [34, 65, 69, 91, 109, 150, 190, 198, 218, 220, 238, 270, 289, 307, 330, 364, 387, 393]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 538 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/1542 places, 662/1449 transitions.
Discarding 131 places :
Symmetric choice reduction at 0 with 131 rule applications. Total rules 131 place count 309 transition count 531
Iterating global reduction 0 with 131 rules applied. Total rules applied 262 place count 309 transition count 531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 263 place count 308 transition count 530
Iterating global reduction 0 with 1 rules applied. Total rules applied 264 place count 308 transition count 530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 265 place count 307 transition count 529
Iterating global reduction 0 with 1 rules applied. Total rules applied 266 place count 307 transition count 529
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 267 place count 306 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 268 place count 306 transition count 528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 305 transition count 527
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 305 transition count 527
Applied a total of 270 rules in 34 ms. Remains 305 /440 variables (removed 135) and now considering 527/662 (removed 135) transitions.
[2023-03-22 04:21:35] [INFO ] Flow matrix only has 439 transitions (discarded 88 similar events)
// Phase 1: matrix 439 rows 305 cols
[2023-03-22 04:21:35] [INFO ] Computed 26 place invariants in 6 ms
[2023-03-22 04:21:36] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 04:21:36] [INFO ] Flow matrix only has 439 transitions (discarded 88 similar events)
[2023-03-22 04:21:36] [INFO ] Invariant cache hit.
[2023-03-22 04:21:36] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 305/1542 places, 527/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1342 ms. Remains : 305/1542 places, 527/1449 transitions.
Support contains 55 out of 305 places after structural reductions.
[2023-03-22 04:21:36] [INFO ] Flatten gal took : 59 ms
[2023-03-22 04:21:36] [INFO ] Flatten gal took : 26 ms
[2023-03-22 04:21:36] [INFO ] Input system was already deterministic with 527 transitions.
Incomplete random walk after 10000 steps, including 375 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 33) seen :22
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 04:21:37] [INFO ] Flow matrix only has 439 transitions (discarded 88 similar events)
[2023-03-22 04:21:37] [INFO ] Invariant cache hit.
[2023-03-22 04:21:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 04:21:37] [INFO ] [Real]Absence check using 3 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-22 04:21:37] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 04:21:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 04:21:38] [INFO ] [Nat]Absence check using 3 positive and 23 generalized place invariants in 8 ms returned sat
[2023-03-22 04:21:38] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :1
[2023-03-22 04:21:38] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 04:21:38] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :1
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 690 edges and 305 vertex of which 14 are kept as prefixes of interest. Removing 291 places using SCC suffix rule.2 ms
Discarding 291 places :
Also discarding 380 output transitions
Drop transitions removed 380 transitions
Drop transitions removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 13 transition count 17
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 136 place count 11 transition count 15
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 10 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 10 transition count 8
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 8 transition count 6
Applied a total of 148 rules in 11 ms. Remains 8 /305 variables (removed 297) and now considering 6/527 (removed 521) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 8/305 places, 6/527 transitions.
Finished random walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 305 stabilizing places and 527 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 305 transition count 527
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' '!(F(G(p0)))'
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 293 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 293 transition count 469
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 237 transition count 469
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 113 place count 237 transition count 442
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 167 place count 210 transition count 442
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 196 place count 181 transition count 413
Iterating global reduction 2 with 29 rules applied. Total rules applied 225 place count 181 transition count 413
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 239 place count 167 transition count 399
Iterating global reduction 2 with 14 rules applied. Total rules applied 253 place count 167 transition count 399
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 258 place count 162 transition count 399
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 258 place count 162 transition count 394
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 268 place count 157 transition count 394
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 275 place count 150 transition count 387
Iterating global reduction 3 with 7 rules applied. Total rules applied 282 place count 150 transition count 387
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 287 place count 145 transition count 382
Iterating global reduction 3 with 5 rules applied. Total rules applied 292 place count 145 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 296 place count 141 transition count 378
Iterating global reduction 3 with 4 rules applied. Total rules applied 300 place count 141 transition count 378
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 366 place count 108 transition count 345
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 377 place count 97 transition count 334
Iterating global reduction 3 with 11 rules applied. Total rules applied 388 place count 97 transition count 334
Applied a total of 388 rules in 74 ms. Remains 97 /305 variables (removed 208) and now considering 334/527 (removed 193) transitions.
[2023-03-22 04:21:38] [INFO ] Flow matrix only has 193 transitions (discarded 141 similar events)
// Phase 1: matrix 193 rows 97 cols
[2023-03-22 04:21:38] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-22 04:21:38] [INFO ] Implicit Places using invariants in 87 ms returned [2, 17, 18, 24, 27, 43, 48, 53, 58, 62, 63, 69, 75, 78]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 93 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/305 places, 334/527 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 323
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 323
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 61 transition count 312
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 61 transition count 312
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 56 transition count 307
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 56 transition count 307
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 52 transition count 303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 50 transition count 301
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 50 transition count 301
Applied a total of 66 rules in 25 ms. Remains 50 /83 variables (removed 33) and now considering 301/334 (removed 33) transitions.
[2023-03-22 04:21:38] [INFO ] Flow matrix only has 57 transitions (discarded 244 similar events)
// Phase 1: matrix 57 rows 50 cols
[2023-03-22 04:21:38] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:21:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 04:21:38] [INFO ] Flow matrix only has 57 transitions (discarded 244 similar events)
[2023-03-22 04:21:38] [INFO ] Invariant cache hit.
[2023-03-22 04:21:38] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/305 places, 301/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 50/305 places, 301/527 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s24 s9) (GT 2 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-00 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||(p1 U G(!p0)))&&((p1 U G(!p0))||G(p2))))))'
Support contains 8 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 295 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 295 transition count 472
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 242 transition count 472
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 107 place count 242 transition count 443
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 165 place count 213 transition count 443
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 192 place count 186 transition count 416
Iterating global reduction 2 with 27 rules applied. Total rules applied 219 place count 186 transition count 416
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 231 place count 174 transition count 404
Iterating global reduction 2 with 12 rules applied. Total rules applied 243 place count 174 transition count 404
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 247 place count 170 transition count 404
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 247 place count 170 transition count 400
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 166 transition count 400
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 160 transition count 394
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 160 transition count 394
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 156 transition count 390
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 156 transition count 390
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 277 place count 154 transition count 388
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 154 transition count 388
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 349 place count 119 transition count 353
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 358 place count 110 transition count 344
Iterating global reduction 3 with 9 rules applied. Total rules applied 367 place count 110 transition count 344
Applied a total of 367 rules in 56 ms. Remains 110 /305 variables (removed 195) and now considering 344/527 (removed 183) transitions.
[2023-03-22 04:21:39] [INFO ] Flow matrix only has 211 transitions (discarded 133 similar events)
// Phase 1: matrix 211 rows 110 cols
[2023-03-22 04:21:39] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-22 04:21:39] [INFO ] Implicit Places using invariants in 77 ms returned [2, 25, 26, 32, 49, 62, 67, 71, 72, 78, 87, 90]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 78 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/305 places, 344/527 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 335
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 335
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 80 transition count 326
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 80 transition count 326
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 77 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 77 transition count 323
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 0 with 14 rules applied. Total rules applied 56 place count 70 transition count 316
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 68 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 68 transition count 314
Applied a total of 60 rules in 15 ms. Remains 68 /98 variables (removed 30) and now considering 314/344 (removed 30) transitions.
[2023-03-22 04:21:39] [INFO ] Flow matrix only has 94 transitions (discarded 220 similar events)
// Phase 1: matrix 94 rows 68 cols
[2023-03-22 04:21:39] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 04:21:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 04:21:39] [INFO ] Flow matrix only has 94 transitions (discarded 220 similar events)
[2023-03-22 04:21:39] [INFO ] Invariant cache hit.
[2023-03-22 04:21:39] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/305 places, 314/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 272 ms. Remains : 68/305 places, 314/527 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1 p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=0 dest: 4}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={2} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={2} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={2} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0, 2} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 5}]], initial=0, aps=[p0:(GT s27 s8), p1:(LEQ s42 s56), p2:(AND (LEQ s20 s16) (LEQ s25 s53))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 7702 reset in 391 ms.
Product exploration explored 100000 steps with 7696 reset in 289 ms.
Computed a total of 68 stabilizing places and 314 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 314
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 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (NOT p0) p1 p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (NOT p0) p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 24 factoid took 1040 ms. Reduced automaton from 6 states, 53 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-03 finished in 2400 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 U (p1||G(p0))))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 294 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 294 transition count 468
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 237 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 236 transition count 467
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 117 place count 236 transition count 440
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 171 place count 209 transition count 440
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 203 place count 177 transition count 408
Iterating global reduction 3 with 32 rules applied. Total rules applied 235 place count 177 transition count 408
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 249 place count 163 transition count 394
Iterating global reduction 3 with 14 rules applied. Total rules applied 263 place count 163 transition count 394
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 269 place count 157 transition count 394
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 269 place count 157 transition count 388
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 281 place count 151 transition count 388
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 289 place count 143 transition count 380
Iterating global reduction 4 with 8 rules applied. Total rules applied 297 place count 143 transition count 380
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 303 place count 137 transition count 374
Iterating global reduction 4 with 6 rules applied. Total rules applied 309 place count 137 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 313 place count 133 transition count 370
Iterating global reduction 4 with 4 rules applied. Total rules applied 317 place count 133 transition count 370
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 379 place count 102 transition count 339
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 390 place count 91 transition count 328
Iterating global reduction 4 with 11 rules applied. Total rules applied 401 place count 91 transition count 328
Applied a total of 401 rules in 39 ms. Remains 91 /305 variables (removed 214) and now considering 328/527 (removed 199) transitions.
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 178 transitions (discarded 150 similar events)
// Phase 1: matrix 178 rows 91 cols
[2023-03-22 04:21:41] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants in 66 ms returned [2, 16, 18, 24, 25, 37, 42, 47, 52, 56, 57, 64, 70, 73]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 67 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/305 places, 328/527 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 66 transition count 317
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 66 transition count 317
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 55 transition count 306
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 55 transition count 306
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 51 transition count 302
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 51 transition count 302
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 47 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 45 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 45 transition count 296
Applied a total of 64 rules in 10 ms. Remains 45 /77 variables (removed 32) and now considering 296/328 (removed 32) transitions.
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 44 transitions (discarded 252 similar events)
// Phase 1: matrix 44 rows 45 cols
[2023-03-22 04:21:41] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 44 transitions (discarded 252 similar events)
[2023-03-22 04:21:41] [INFO ] Invariant cache hit.
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/305 places, 296/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 45/305 places, 296/527 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s33 s23) (GT s6 s13)), p0:(GT s6 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-04 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(p0)))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 295 transition count 527
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 54 place count 251 transition count 483
Iterating global reduction 1 with 44 rules applied. Total rules applied 98 place count 251 transition count 483
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 131 place count 218 transition count 450
Iterating global reduction 1 with 33 rules applied. Total rules applied 164 place count 218 transition count 450
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 172 place count 210 transition count 450
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 206 place count 176 transition count 416
Iterating global reduction 2 with 34 rules applied. Total rules applied 240 place count 176 transition count 416
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 250 place count 166 transition count 416
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 282 place count 134 transition count 384
Iterating global reduction 3 with 32 rules applied. Total rules applied 314 place count 134 transition count 384
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 332 place count 116 transition count 366
Iterating global reduction 3 with 18 rules applied. Total rules applied 350 place count 116 transition count 366
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 368 place count 98 transition count 348
Iterating global reduction 3 with 18 rules applied. Total rules applied 386 place count 98 transition count 348
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 408 place count 76 transition count 326
Iterating global reduction 3 with 22 rules applied. Total rules applied 430 place count 76 transition count 326
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 444 place count 62 transition count 312
Iterating global reduction 3 with 14 rules applied. Total rules applied 458 place count 62 transition count 312
Applied a total of 458 rules in 26 ms. Remains 62 /305 variables (removed 243) and now considering 312/527 (removed 215) transitions.
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 68 transitions (discarded 244 similar events)
// Phase 1: matrix 68 rows 62 cols
[2023-03-22 04:21:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants in 47 ms returned [23, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/305 places, 312/527 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 310
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 57 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 57 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 56 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 56 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 55 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 55 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 54 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 54 transition count 306
Applied a total of 12 rules in 3 ms. Remains 54 /60 variables (removed 6) and now considering 306/312 (removed 6) transitions.
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 55 transitions (discarded 251 similar events)
// Phase 1: matrix 55 rows 54 cols
[2023-03-22 04:21:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 04:21:41] [INFO ] Flow matrix only has 55 transitions (discarded 251 similar events)
[2023-03-22 04:21:41] [INFO ] Invariant cache hit.
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/305 places, 306/527 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 54/305 places, 306/527 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT s44 s21)], 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 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-05 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1||(p2 U X(p2))))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 299 transition count 527
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 45 place count 260 transition count 488
Iterating global reduction 1 with 39 rules applied. Total rules applied 84 place count 260 transition count 488
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 112 place count 232 transition count 460
Iterating global reduction 1 with 28 rules applied. Total rules applied 140 place count 232 transition count 460
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 147 place count 225 transition count 460
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 175 place count 197 transition count 432
Iterating global reduction 2 with 28 rules applied. Total rules applied 203 place count 197 transition count 432
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 210 place count 190 transition count 432
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 234 place count 166 transition count 408
Iterating global reduction 3 with 24 rules applied. Total rules applied 258 place count 166 transition count 408
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 272 place count 152 transition count 394
Iterating global reduction 3 with 14 rules applied. Total rules applied 286 place count 152 transition count 394
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 300 place count 138 transition count 380
Iterating global reduction 3 with 14 rules applied. Total rules applied 314 place count 138 transition count 380
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 332 place count 120 transition count 362
Iterating global reduction 3 with 18 rules applied. Total rules applied 350 place count 120 transition count 362
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 361 place count 109 transition count 351
Iterating global reduction 3 with 11 rules applied. Total rules applied 372 place count 109 transition count 351
Applied a total of 372 rules in 21 ms. Remains 109 /305 variables (removed 196) and now considering 351/527 (removed 176) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 139 transitions (discarded 212 similar events)
// Phase 1: matrix 139 rows 109 cols
[2023-03-22 04:21:42] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 57 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/305 places, 351/527 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 350
Applied a total of 2 rules in 2 ms. Remains 107 /108 variables (removed 1) and now considering 350/351 (removed 1) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 138 transitions (discarded 212 similar events)
// Phase 1: matrix 138 rows 107 cols
[2023-03-22 04:21:42] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 138 transitions (discarded 212 similar events)
[2023-03-22 04:21:42] [INFO ] Invariant cache hit.
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/305 places, 350/527 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 107/305 places, 350/527 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s39 s88), p1:(AND (LEQ s77 s34) (LEQ s10 s51)), p2:(LEQ s77 s34)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-06 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 293 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 293 transition count 468
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 236 transition count 468
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 115 place count 236 transition count 440
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 171 place count 208 transition count 440
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 201 place count 178 transition count 410
Iterating global reduction 2 with 30 rules applied. Total rules applied 231 place count 178 transition count 410
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 245 place count 164 transition count 396
Iterating global reduction 2 with 14 rules applied. Total rules applied 259 place count 164 transition count 396
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 263 place count 160 transition count 396
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 263 place count 160 transition count 392
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 271 place count 156 transition count 392
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 277 place count 150 transition count 386
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 150 transition count 386
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 146 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 146 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 144 transition count 380
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 144 transition count 380
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 363 place count 110 transition count 346
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 374 place count 99 transition count 335
Iterating global reduction 3 with 11 rules applied. Total rules applied 385 place count 99 transition count 335
Applied a total of 385 rules in 34 ms. Remains 99 /305 variables (removed 206) and now considering 335/527 (removed 192) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 201 transitions (discarded 134 similar events)
// Phase 1: matrix 201 rows 99 cols
[2023-03-22 04:21:42] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 70 ms returned [2, 13, 19, 20, 26, 27, 44, 49, 54, 59, 63, 64, 70, 76, 79]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 71 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/305 places, 335/527 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 323
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 323
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 60 transition count 311
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 60 transition count 311
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 55 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 55 transition count 306
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 50 transition count 301
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 48 transition count 299
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 48 transition count 299
Applied a total of 72 rules in 11 ms. Remains 48 /84 variables (removed 36) and now considering 299/335 (removed 36) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
// Phase 1: matrix 54 rows 48 cols
[2023-03-22 04:21:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 54 transitions (discarded 245 similar events)
[2023-03-22 04:21:42] [INFO ] Invariant cache hit.
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/305 places, 299/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 48/305 places, 299/527 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s24 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 338 steps with 27 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-07 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p0)))||G(p2)))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 293 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 293 transition count 471
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 239 transition count 471
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 109 place count 239 transition count 442
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 167 place count 210 transition count 442
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 196 place count 181 transition count 413
Iterating global reduction 2 with 29 rules applied. Total rules applied 225 place count 181 transition count 413
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 237 place count 169 transition count 401
Iterating global reduction 2 with 12 rules applied. Total rules applied 249 place count 169 transition count 401
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 253 place count 165 transition count 401
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 253 place count 165 transition count 397
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 161 transition count 397
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 267 place count 155 transition count 391
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 155 transition count 391
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 151 transition count 387
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 151 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 149 transition count 385
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 149 transition count 385
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 353 place count 115 transition count 351
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 362 place count 106 transition count 342
Iterating global reduction 3 with 9 rules applied. Total rules applied 371 place count 106 transition count 342
Applied a total of 371 rules in 35 ms. Remains 106 /305 variables (removed 199) and now considering 342/527 (removed 185) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 209 transitions (discarded 133 similar events)
// Phase 1: matrix 209 rows 106 cols
[2023-03-22 04:21:42] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 75 ms returned [17, 18, 24, 25, 35, 42, 47, 52, 63, 64, 82, 86]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 76 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/305 places, 342/527 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 85 transition count 333
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 85 transition count 333
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 76 transition count 324
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 76 transition count 324
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 70 transition count 318
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 70 transition count 318
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 66 transition count 314
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 64 transition count 312
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 64 transition count 312
Applied a total of 60 rules in 15 ms. Remains 64 /94 variables (removed 30) and now considering 312/342 (removed 30) transitions.
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 92 transitions (discarded 220 similar events)
// Phase 1: matrix 92 rows 64 cols
[2023-03-22 04:21:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:21:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 04:21:42] [INFO ] Flow matrix only has 92 transitions (discarded 220 similar events)
[2023-03-22 04:21:42] [INFO ] Invariant cache hit.
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/305 places, 312/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 64/305 places, 312/527 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NOT (OR (LEQ 2 s4) (LEQ s36 s53))) (GT 1 s48)), p0:(GT 1 s48), p2:(GT s44 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 922 steps with 74 reset in 8 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-08 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 295 transition count 527
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 54 place count 251 transition count 483
Iterating global reduction 1 with 44 rules applied. Total rules applied 98 place count 251 transition count 483
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 132 place count 217 transition count 449
Iterating global reduction 1 with 34 rules applied. Total rules applied 166 place count 217 transition count 449
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 174 place count 209 transition count 449
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 208 place count 175 transition count 415
Iterating global reduction 2 with 34 rules applied. Total rules applied 242 place count 175 transition count 415
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 253 place count 164 transition count 415
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 286 place count 131 transition count 382
Iterating global reduction 3 with 33 rules applied. Total rules applied 319 place count 131 transition count 382
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 338 place count 112 transition count 363
Iterating global reduction 3 with 19 rules applied. Total rules applied 357 place count 112 transition count 363
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 376 place count 93 transition count 344
Iterating global reduction 3 with 19 rules applied. Total rules applied 395 place count 93 transition count 344
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 418 place count 70 transition count 321
Iterating global reduction 3 with 23 rules applied. Total rules applied 441 place count 70 transition count 321
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 456 place count 55 transition count 306
Iterating global reduction 3 with 15 rules applied. Total rules applied 471 place count 55 transition count 306
Applied a total of 471 rules in 19 ms. Remains 55 /305 variables (removed 250) and now considering 306/527 (removed 221) transitions.
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 55 transitions (discarded 251 similar events)
// Phase 1: matrix 55 rows 55 cols
[2023-03-22 04:21:43] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants in 48 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/305 places, 306/527 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 305
Applied a total of 2 rules in 3 ms. Remains 53 /54 variables (removed 1) and now considering 305/306 (removed 1) transitions.
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
// Phase 1: matrix 54 rows 53 cols
[2023-03-22 04:21:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 54 transitions (discarded 251 similar events)
[2023-03-22 04:21:43] [INFO ] Invariant cache hit.
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/305 places, 305/527 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 53/305 places, 305/527 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ 1 s20) (GT 1 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-09 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0))&&X(X(X(p2)))))'
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 296 transition count 527
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 49 place count 256 transition count 487
Iterating global reduction 1 with 40 rules applied. Total rules applied 89 place count 256 transition count 487
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 121 place count 224 transition count 455
Iterating global reduction 1 with 32 rules applied. Total rules applied 153 place count 224 transition count 455
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 161 place count 216 transition count 455
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 193 place count 184 transition count 423
Iterating global reduction 2 with 32 rules applied. Total rules applied 225 place count 184 transition count 423
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 235 place count 174 transition count 423
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 264 place count 145 transition count 394
Iterating global reduction 3 with 29 rules applied. Total rules applied 293 place count 145 transition count 394
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 311 place count 127 transition count 376
Iterating global reduction 3 with 18 rules applied. Total rules applied 329 place count 127 transition count 376
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 346 place count 110 transition count 359
Iterating global reduction 3 with 17 rules applied. Total rules applied 363 place count 110 transition count 359
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 384 place count 89 transition count 338
Iterating global reduction 3 with 21 rules applied. Total rules applied 405 place count 89 transition count 338
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 77 transition count 326
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 77 transition count 326
Applied a total of 429 rules in 18 ms. Remains 77 /305 variables (removed 228) and now considering 326/527 (removed 201) transitions.
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 99 transitions (discarded 227 similar events)
// Phase 1: matrix 99 rows 77 cols
[2023-03-22 04:21:43] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants in 59 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/305 places, 326/527 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 73 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 323
Applied a total of 6 rules in 1 ms. Remains 73 /76 variables (removed 3) and now considering 323/326 (removed 3) transitions.
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 96 transitions (discarded 227 similar events)
// Phase 1: matrix 96 rows 73 cols
[2023-03-22 04:21:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 96 transitions (discarded 227 similar events)
[2023-03-22 04:21:43] [INFO ] Invariant cache hit.
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/305 places, 323/527 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 73/305 places, 323/527 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT s31 s44) (GT s51 s70)), p1:(GT s51 s70), p2:(LEQ 1 s38)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-11 finished in 440 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))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 527/527 transitions.
Graph (complete) has 1003 edges and 305 vertex of which 293 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 293 transition count 466
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 234 transition count 466
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 119 place count 234 transition count 440
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 171 place count 208 transition count 440
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 202 place count 177 transition count 409
Iterating global reduction 2 with 31 rules applied. Total rules applied 233 place count 177 transition count 409
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 248 place count 162 transition count 394
Iterating global reduction 2 with 15 rules applied. Total rules applied 263 place count 162 transition count 394
Discarding 6 places :
Implicit places reduction removed 6 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 270 place count 156 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 271 place count 155 transition count 393
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 271 place count 155 transition count 387
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 283 place count 149 transition count 387
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 290 place count 142 transition count 380
Iterating global reduction 4 with 7 rules applied. Total rules applied 297 place count 142 transition count 380
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 302 place count 137 transition count 375
Iterating global reduction 4 with 5 rules applied. Total rules applied 307 place count 137 transition count 375
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 309 place count 135 transition count 373
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 135 transition count 373
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 375 place count 103 transition count 341
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 386 place count 92 transition count 330
Iterating global reduction 4 with 11 rules applied. Total rules applied 397 place count 92 transition count 330
Applied a total of 397 rules in 36 ms. Remains 92 /305 variables (removed 213) and now considering 330/527 (removed 197) transitions.
[2023-03-22 04:21:43] [INFO ] Flow matrix only has 189 transitions (discarded 141 similar events)
// Phase 1: matrix 189 rows 92 cols
[2023-03-22 04:21:43] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-22 04:21:44] [INFO ] Implicit Places using invariants in 71 ms returned [2, 17, 18, 24, 25, 37, 42, 47, 52, 56, 57, 63, 70, 73]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 72 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/305 places, 330/527 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 67 transition count 319
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 67 transition count 319
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 56 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 56 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 51 transition count 303
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 51 transition count 303
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 46 transition count 298
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 44 transition count 296
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 44 transition count 296
Applied a total of 68 rules in 8 ms. Remains 44 /78 variables (removed 34) and now considering 296/330 (removed 34) transitions.
[2023-03-22 04:21:44] [INFO ] Flow matrix only has 51 transitions (discarded 245 similar events)
// Phase 1: matrix 51 rows 44 cols
[2023-03-22 04:21:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:21:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 04:21:44] [INFO ] Flow matrix only has 51 transitions (discarded 245 similar events)
[2023-03-22 04:21:44] [INFO ] Invariant cache hit.
[2023-03-22 04:21:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/305 places, 296/527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 44/305 places, 296/527 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s33 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 271 steps with 22 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-12 finished in 258 ms.
All properties solved by simple procedures.
Total runtime 9638 ms.
ITS solved all properties within timeout

BK_STOP 1679458905367

--------------------
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-S16C3"
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-S16C3, 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-167856416100483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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