About the Execution of LoLa+red for LeafsetExtension-PT-S64C2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3197.268 | 241607.00 | 284779.00 | 2628.30 | FTFFFTFFFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416200524.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-S64C2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416200524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 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 14M 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-S64C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679461298911
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 05:01:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:01:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:01:41] [INFO ] Load time of PNML (sax parser for PT used): 837 ms
[2023-03-22 05:01:41] [INFO ] Transformed 21462 places.
[2023-03-22 05:01:41] [INFO ] Transformed 21129 transitions.
[2023-03-22 05:01:41] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 451 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 05:01:44] [INFO ] Computed 198 place invariants in 1845 ms
[2023-03-22 05:01:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:01:46] [INFO ] Implicit Places using invariants in 3595 ms returned []
Implicit Place search using SMT only with invariants took 3674 ms to find 0 implicit places.
[2023-03-22 05:01:46] [INFO ] Invariant cache hit.
[2023-03-22 05:01:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:01:47] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5604 ms. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 63 out of 17233 places after structural reductions.
[2023-03-22 05:01:49] [INFO ] Flatten gal took : 930 ms
[2023-03-22 05:01:49] [INFO ] Flatten gal took : 650 ms
[2023-03-22 05:01:50] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 59 out of 17233 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 34) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-22 05:01:51] [INFO ] Invariant cache hit.
[2023-03-22 05:01:57] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 365 ms returned sat
[2023-03-22 05:02:16] [INFO ] After 16163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2023-03-22 05:02:16] [INFO ] After 16194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 05:02:17] [INFO ] After 25068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :16
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 17233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 917 are kept as prefixes of interest. Removing 16316 places using SCC suffix rule.32 ms
Discarding 16316 places :
Also discarding 12081 output transitions
Drop transitions removed 12081 transitions
Drop transitions removed 4113 transitions
Reduce isomorphic transitions removed 4113 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 4363 rules applied. Total rules applied 4364 place count 917 transition count 4685
Reduce places removed 252 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 255 rules applied. Total rules applied 4619 place count 665 transition count 4682
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4622 place count 662 transition count 4682
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4622 place count 662 transition count 4674
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 4638 place count 654 transition count 4674
Discarding 149 places :
Symmetric choice reduction at 3 with 149 rule applications. Total rules 4787 place count 505 transition count 4525
Iterating global reduction 3 with 149 rules applied. Total rules applied 4936 place count 505 transition count 4525
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4942 place count 505 transition count 4519
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 4948 place count 499 transition count 4519
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 4 with 93 rules applied. Total rules applied 5041 place count 499 transition count 4519
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 5044 place count 496 transition count 4519
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 5047 place count 496 transition count 4516
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 5050 place count 493 transition count 4516
Applied a total of 5050 rules in 681 ms. Remains 493 /17233 variables (removed 16740) and now considering 4516/21129 (removed 16613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 493/17233 places, 4516/21129 transitions.
Finished random walk after 9092 steps, including 1134 resets, run visited all 17 properties in 178 ms. (steps per millisecond=51 )
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.59 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8287 transitions
Trivial Post-agglo rules discarded 8287 transitions
Performed 8287 trivial Post agglomeration. Transition count delta: 8287
Iterating post reduction 0 with 8287 rules applied. Total rules applied 8288 place count 17231 transition count 12840
Reduce places removed 8287 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16607 place count 8944 transition count 12808
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12679
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4754 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4754 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4754 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Applied a total of 24957 rules in 3123 ms. Remains 4753 /17233 variables (removed 12480) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2023-03-22 05:02:21] [INFO ] Computed 198 place invariants in 99 ms
[2023-03-22 05:02:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:02:25] [INFO ] Implicit Places using invariants in 3549 ms returned [642, 781, 1210, 2702, 3270]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3556 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4748/17233 places, 8649/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4745 transition count 8646
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4745 transition count 8646
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4742 transition count 8643
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4742 transition count 8643
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 86 place count 4668 transition count 8569
Iterating global reduction 0 with 74 rules applied. Total rules applied 160 place count 4668 transition count 8569
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 282 place count 4607 transition count 8508
Applied a total of 282 rules in 3628 ms. Remains 4607 /4748 variables (removed 141) and now considering 8508/8649 (removed 141) transitions.
[2023-03-22 05:02:28] [INFO ] Flow matrix only has 8434 transitions (discarded 74 similar events)
// Phase 1: matrix 8434 rows 4607 cols
[2023-03-22 05:02:28] [INFO ] Computed 193 place invariants in 83 ms
[2023-03-22 05:02:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:02:32] [INFO ] Implicit Places using invariants in 3410 ms returned [525, 2217, 3176, 3528, 3738]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3417 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4602/17233 places, 8508/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4599 transition count 8505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4599 transition count 8505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4596 transition count 8502
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4596 transition count 8502
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 86 place count 4522 transition count 8428
Iterating global reduction 0 with 74 rules applied. Total rules applied 160 place count 4522 transition count 8428
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 286 place count 4459 transition count 8365
Applied a total of 286 rules in 3204 ms. Remains 4459 /4602 variables (removed 143) and now considering 8365/8508 (removed 143) transitions.
[2023-03-22 05:02:35] [INFO ] Flow matrix only has 8216 transitions (discarded 149 similar events)
// Phase 1: matrix 8216 rows 4459 cols
[2023-03-22 05:02:35] [INFO ] Computed 188 place invariants in 82 ms
[2023-03-22 05:02:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:02:38] [INFO ] Implicit Places using invariants in 3372 ms returned [1283, 1663, 2336, 3531]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3377 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4455/17233 places, 8365/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4452 transition count 8362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4452 transition count 8362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4451 transition count 8361
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4451 transition count 8361
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 37 place count 4422 transition count 8332
Iterating global reduction 0 with 29 rules applied. Total rules applied 66 place count 4422 transition count 8332
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 0 with 244 rules applied. Total rules applied 310 place count 4300 transition count 8210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 311 place count 4299 transition count 8209
Iterating global reduction 0 with 1 rules applied. Total rules applied 312 place count 4299 transition count 8209
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 344 place count 4267 transition count 8177
Iterating global reduction 0 with 32 rules applied. Total rules applied 376 place count 4267 transition count 8177
Applied a total of 376 rules in 4032 ms. Remains 4267 /4455 variables (removed 188) and now considering 8177/8365 (removed 188) transitions.
[2023-03-22 05:02:42] [INFO ] Flow matrix only has 7962 transitions (discarded 215 similar events)
// Phase 1: matrix 7962 rows 4267 cols
[2023-03-22 05:02:42] [INFO ] Computed 184 place invariants in 78 ms
[2023-03-22 05:02:45] [INFO ] Implicit Places using invariants in 2778 ms returned [1316, 1784, 2021, 3435, 3771]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2783 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4262/17233 places, 8177/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4258 transition count 8173
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4258 transition count 8173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4254 transition count 8169
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4254 transition count 8169
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 111 place count 4159 transition count 8074
Iterating global reduction 0 with 95 rules applied. Total rules applied 206 place count 4159 transition count 8074
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 208 place count 4158 transition count 8073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 4157 transition count 8072
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 4157 transition count 8072
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 260 place count 4107 transition count 8022
Iterating global reduction 0 with 50 rules applied. Total rules applied 310 place count 4107 transition count 8022
Applied a total of 310 rules in 3741 ms. Remains 4107 /4262 variables (removed 155) and now considering 8022/8177 (removed 155) transitions.
[2023-03-22 05:02:49] [INFO ] Flow matrix only has 7652 transitions (discarded 370 similar events)
// Phase 1: matrix 7652 rows 4107 cols
[2023-03-22 05:02:49] [INFO ] Computed 179 place invariants in 72 ms
[2023-03-22 05:02:51] [INFO ] Implicit Places using invariants in 2717 ms returned [201, 538, 1956, 3375, 3719]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2732 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4102/17233 places, 8022/21129 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 4043 transition count 7963
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 4043 transition count 7963
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 4041 transition count 7961
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 4041 transition count 7961
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 179 place count 3984 transition count 7904
Iterating global reduction 0 with 57 rules applied. Total rules applied 236 place count 3984 transition count 7904
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 0 with 114 rules applied. Total rules applied 350 place count 3927 transition count 7847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 351 place count 3926 transition count 7846
Iterating global reduction 0 with 1 rules applied. Total rules applied 352 place count 3926 transition count 7846
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 382 place count 3896 transition count 7816
Iterating global reduction 0 with 30 rules applied. Total rules applied 412 place count 3896 transition count 7816
Applied a total of 412 rules in 3257 ms. Remains 3896 /4102 variables (removed 206) and now considering 7816/8022 (removed 206) transitions.
[2023-03-22 05:02:55] [INFO ] Flow matrix only has 7350 transitions (discarded 466 similar events)
// Phase 1: matrix 7350 rows 3896 cols
[2023-03-22 05:02:55] [INFO ] Computed 174 place invariants in 63 ms
[2023-03-22 05:02:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:02:57] [INFO ] Implicit Places using invariants in 2639 ms returned [1807, 2411, 2901, 3031]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2644 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3892/17233 places, 7816/21129 transitions.
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 117 place count 3775 transition count 7699
Iterating global reduction 0 with 117 rules applied. Total rules applied 234 place count 3775 transition count 7699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 3774 transition count 7698
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 3774 transition count 7698
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 265 place count 3745 transition count 7669
Iterating global reduction 0 with 29 rules applied. Total rules applied 294 place count 3745 transition count 7669
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 410 place count 3687 transition count 7611
Applied a total of 410 rules in 2092 ms. Remains 3687 /3892 variables (removed 205) and now considering 7611/7816 (removed 205) transitions.
[2023-03-22 05:02:59] [INFO ] Flow matrix only has 7110 transitions (discarded 501 similar events)
// Phase 1: matrix 7110 rows 3687 cols
[2023-03-22 05:03:00] [INFO ] Computed 170 place invariants in 65 ms
[2023-03-22 05:03:03] [INFO ] Implicit Places using invariants in 3836 ms returned [3, 32, 62, 65, 94, 124, 127, 157, 189, 218, 248, 251, 280, 310, 313, 342, 372, 375, 404, 434, 437, 495, 526, 556, 560, 589, 592, 622, 654, 683, 713, 716, 745, 775, 778, 807, 837, 840, 869, 899, 902, 931, 961, 964, 993, 1023, 1033, 1062, 1065, 1095, 1127, 1156, 1186, 1191, 1220, 1223, 1252, 1282, 1285, 1314, 1344, 1347, 1376, 1406, 1409, 1439, 1442, 1471, 1501, 1504, 1533, 1563, 1566, 1596, 1599, 1628, 1658, 1661, 1690, 1720, 1733, 1764, 1793, 1795, 1798, 1827, 1830, 1859, 1889, 1892, 1924, 1927, 1956, 1986, 1989, 2018, 2048, 2051, 2080, 2110, 2113, 2142, 2145, 2174, 2204, 2207, 2236, 2269, 2298, 2328, 2331, 2360, 2390, 2393, 2422, 2452, 2455, 2484, 2514, 2517, 2546, 2579, 2608, 2611, 2640, 2670, 2673, 2702, 2735, 2764, 2794, 2797, 2826, 2859, 2902, 2905, 2934, 2967, 2996, 3026, 3031, 3034, 3065, 3068, 3097, 3127, 3130, 3159, 3189, 3192, 3221, 3251, 3254, 3288, 3291, 3320, 3350, 3353, 3382, 3385, 3414, 3444, 3447, 3509, 3512, 3541, 3571]
Discarding 167 places :
Implicit Place search using SMT only with invariants took 3848 ms to find 167 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3520/17233 places, 7611/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3520 transition count 7610
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3519 transition count 7610
Discarding 3152 places :
Symmetric choice reduction at 0 with 3152 rule applications. Total rules 3154 place count 367 transition count 4458
Iterating global reduction 0 with 3152 rules applied. Total rules applied 6306 place count 367 transition count 4458
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 6415 place count 258 transition count 4349
Iterating global reduction 0 with 109 rules applied. Total rules applied 6524 place count 258 transition count 4349
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 6633 place count 149 transition count 4240
Iterating global reduction 0 with 109 rules applied. Total rules applied 6742 place count 149 transition count 4240
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6752 place count 144 transition count 4235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6753 place count 143 transition count 4234
Iterating global reduction 0 with 1 rules applied. Total rules applied 6754 place count 143 transition count 4234
Applied a total of 6754 rules in 212 ms. Remains 143 /3520 variables (removed 3377) and now considering 4234/7611 (removed 3377) transitions.
[2023-03-22 05:03:04] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
// Phase 1: matrix 172 rows 143 cols
[2023-03-22 05:03:04] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 05:03:04] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-22 05:03:04] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
[2023-03-22 05:03:04] [INFO ] Invariant cache hit.
[2023-03-22 05:03:04] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 143/17233 places, 4234/21129 transitions.
Finished structural reductions in SI_LTL mode , in 8 iterations and 46298 ms. Remains : 143/17233 places, 4234/21129 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s132 1) (LT s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10918 reset in 562 ms.
Product exploration explored 100000 steps with 10929 reset in 558 ms.
Computed a total of 143 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-01 finished in 48189 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(p1)&&p0)))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 69 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 05:03:08] [INFO ] Computed 198 place invariants in 1540 ms
[2023-03-22 05:03:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:09] [INFO ] Implicit Places using invariants in 2908 ms returned []
Implicit Place search using SMT only with invariants took 2909 ms to find 0 implicit places.
[2023-03-22 05:03:09] [INFO ] Invariant cache hit.
[2023-03-22 05:03:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:10] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4336 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s7231 1) (LT s8943 1)), p0:(AND (GEQ s7034 1) (GEQ s7099 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-04 finished in 4543 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 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8287 transitions
Trivial Post-agglo rules discarded 8287 transitions
Performed 8287 trivial Post agglomeration. Transition count delta: 8287
Iterating post reduction 0 with 8287 rules applied. Total rules applied 8288 place count 17231 transition count 12840
Reduce places removed 8287 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16607 place count 8944 transition count 12808
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12679
Deduced a syphon composed of 129 places in 4 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4754 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4754 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4754 transition count 8649
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Applied a total of 24957 rules in 2473 ms. Remains 4753 /17233 variables (removed 12480) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2023-03-22 05:03:13] [INFO ] Computed 198 place invariants in 89 ms
[2023-03-22 05:03:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:16] [INFO ] Implicit Places using invariants in 3373 ms returned [1317, 1423, 1885, 3945, 4619]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3378 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4748/17233 places, 8649/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4746 transition count 8647
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4746 transition count 8647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4744 transition count 8645
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4744 transition count 8645
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 49 place count 4703 transition count 8604
Iterating global reduction 0 with 41 rules applied. Total rules applied 90 place count 4703 transition count 8604
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 0 with 252 rules applied. Total rules applied 342 place count 4577 transition count 8478
Applied a total of 342 rules in 3275 ms. Remains 4577 /4748 variables (removed 171) and now considering 8478/8649 (removed 171) transitions.
[2023-03-22 05:03:20] [INFO ] Flow matrix only has 8437 transitions (discarded 41 similar events)
// Phase 1: matrix 8437 rows 4577 cols
[2023-03-22 05:03:20] [INFO ] Computed 193 place invariants in 88 ms
[2023-03-22 05:03:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:23] [INFO ] Implicit Places using invariants in 3197 ms returned [276, 2765, 3216, 3827, 3893]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3210 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4572/17233 places, 8478/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4570 transition count 8476
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4570 transition count 8476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4568 transition count 8474
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4568 transition count 8474
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 70 place count 4506 transition count 8412
Iterating global reduction 0 with 62 rules applied. Total rules applied 132 place count 4506 transition count 8412
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 0 with 250 rules applied. Total rules applied 382 place count 4381 transition count 8287
Applied a total of 382 rules in 2947 ms. Remains 4381 /4572 variables (removed 191) and now considering 8287/8478 (removed 191) transitions.
[2023-03-22 05:03:26] [INFO ] Flow matrix only has 8182 transitions (discarded 105 similar events)
// Phase 1: matrix 8182 rows 4381 cols
[2023-03-22 05:03:26] [INFO ] Computed 188 place invariants in 81 ms
[2023-03-22 05:03:29] [INFO ] Implicit Places using invariants in 2847 ms returned [2050, 2453, 2651, 2996, 3817]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2853 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4376/17233 places, 8287/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4372 transition count 8283
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4372 transition count 8283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4369 transition count 8280
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4369 transition count 8280
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 101 place count 4282 transition count 8193
Iterating global reduction 0 with 87 rules applied. Total rules applied 188 place count 4282 transition count 8193
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 308 place count 4222 transition count 8133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 309 place count 4221 transition count 8132
Iterating global reduction 0 with 1 rules applied. Total rules applied 310 place count 4221 transition count 8132
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 340 place count 4191 transition count 8102
Iterating global reduction 0 with 30 rules applied. Total rules applied 370 place count 4191 transition count 8102
Applied a total of 370 rules in 3583 ms. Remains 4191 /4376 variables (removed 185) and now considering 8102/8287 (removed 185) transitions.
[2023-03-22 05:03:32] [INFO ] Flow matrix only has 7871 transitions (discarded 231 similar events)
// Phase 1: matrix 7871 rows 4191 cols
[2023-03-22 05:03:32] [INFO ] Computed 183 place invariants in 75 ms
[2023-03-22 05:03:35] [INFO ] Implicit Places using invariants in 2711 ms returned [531, 666, 1985, 3161]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2717 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4187/17233 places, 8102/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4185 transition count 8100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4185 transition count 8100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4183 transition count 8098
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4183 transition count 8098
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 46 place count 4145 transition count 8060
Iterating global reduction 0 with 38 rules applied. Total rules applied 84 place count 4145 transition count 8060
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 206 place count 4084 transition count 7999
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 4083 transition count 7998
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 4083 transition count 7998
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 238 place count 4053 transition count 7968
Iterating global reduction 0 with 30 rules applied. Total rules applied 268 place count 4053 transition count 7968
Applied a total of 268 rules in 3395 ms. Remains 4053 /4187 variables (removed 134) and now considering 7968/8102 (removed 134) transitions.
[2023-03-22 05:03:38] [INFO ] Flow matrix only has 7661 transitions (discarded 307 similar events)
// Phase 1: matrix 7661 rows 4053 cols
[2023-03-22 05:03:38] [INFO ] Computed 179 place invariants in 69 ms
[2023-03-22 05:03:43] [INFO ] Implicit Places using invariants in 4266 ms returned [3, 33, 65, 68, 98, 130, 133, 163, 195, 198, 229, 263, 293, 325, 328, 358, 390, 393, 423, 455, 491, 526, 556, 588, 591, 621, 653, 685, 717, 720, 750, 782, 785, 815, 847, 850, 880, 912, 915, 945, 977, 980, 1010, 1042, 1045, 1075, 1107, 1110, 1140, 1172, 1175, 1236, 1239, 1270, 1304, 1334, 1366, 1369, 1399, 1431, 1434, 1464, 1496, 1499, 1529, 1561, 1564, 1594, 1626, 1629, 1659, 1691, 1694, 1725, 1728, 1758, 1790, 1793, 1823, 1855, 1858, 1888, 1920, 1923, 1954, 1977, 2008, 2010, 2012, 2042, 2074, 2077, 2107, 2139, 2142, 2172, 2204, 2207, 2237, 2269, 2272, 2302, 2334, 2338, 2369, 2372, 2402, 2434, 2437, 2467, 2502, 2540, 2543, 2573, 2605, 2608, 2638, 2670, 2673, 2703, 2735, 2738, 2768, 2800, 2803, 2839, 2842, 2872, 2904, 2907, 2938, 2941, 2971, 3003, 3006, 3036, 3068, 3071, 3102, 3105, 3135, 3167, 3170, 3200, 3232, 3235, 3265, 3297, 3300, 3330, 3362, 3365, 3406, 3409, 3443, 3473, 3505, 3508, 3541, 3544, 3574, 3606, 3609, 3639, 3671, 3674, 3704, 3736, 3739, 3769, 3801, 3804, 3834, 3866, 3869, 3899]
Discarding 176 places :
Implicit Place search using SMT only with invariants took 4273 ms to find 176 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3877/17233 places, 7968/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3877 transition count 7967
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3876 transition count 7967
Discarding 3497 places :
Symmetric choice reduction at 0 with 3497 rule applications. Total rules 3499 place count 379 transition count 4470
Iterating global reduction 0 with 3497 rules applied. Total rules applied 6996 place count 379 transition count 4470
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 7111 place count 264 transition count 4355
Iterating global reduction 0 with 115 rules applied. Total rules applied 7226 place count 264 transition count 4355
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 7341 place count 149 transition count 4240
Iterating global reduction 0 with 115 rules applied. Total rules applied 7456 place count 149 transition count 4240
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 7466 place count 144 transition count 4235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7467 place count 143 transition count 4234
Iterating global reduction 0 with 1 rules applied. Total rules applied 7468 place count 143 transition count 4234
Applied a total of 7468 rules in 230 ms. Remains 143 /3877 variables (removed 3734) and now considering 4234/7968 (removed 3734) transitions.
[2023-03-22 05:03:43] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
// Phase 1: matrix 172 rows 143 cols
[2023-03-22 05:03:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 05:03:43] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-22 05:03:43] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
[2023-03-22 05:03:43] [INFO ] Invariant cache hit.
[2023-03-22 05:03:44] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 143/17233 places, 4234/21129 transitions.
Finished structural reductions in SI_LTL mode , in 6 iterations and 33021 ms. Remains : 143/17233 places, 4234/21129 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10934 reset in 443 ms.
Product exploration explored 100000 steps with 10921 reset in 490 ms.
Computed a total of 143 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-05 finished in 34496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X((F(p0)&&p1)))))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 70 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 05:03:47] [INFO ] Computed 198 place invariants in 1478 ms
[2023-03-22 05:03:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:48] [INFO ] Implicit Places using invariants in 2840 ms returned []
Implicit Place search using SMT only with invariants took 2847 ms to find 0 implicit places.
[2023-03-22 05:03:48] [INFO ] Invariant cache hit.
[2023-03-22 05:03:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:49] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4263 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(GEQ s3038 1), p1:(AND (GEQ s11046 1) (GEQ s12889 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-06 finished in 4524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U (p1 U p2))) U p3))'
Support contains 7 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 69 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 05:03:50] [INFO ] Invariant cache hit.
[2023-03-22 05:03:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:51] [INFO ] Implicit Places using invariants in 1349 ms returned []
Implicit Place search using SMT only with invariants took 1351 ms to find 0 implicit places.
[2023-03-22 05:03:51] [INFO ] Invariant cache hit.
[2023-03-22 05:03:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:52] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2782 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s5523 1) (GEQ s6131 1) (GEQ s526 1) (GEQ s12368 1)), p2:(AND (GEQ s2105 1) (GEQ s8942 1)), p1:(GEQ s10090 1), p0:(AND (GEQ s5523 1) (GEQ s613...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-07 finished in 3049 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(p0) U p1)&&(F(X(p2))||p2))))'
Support contains 6 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8128 transitions
Trivial Post-agglo rules discarded 8128 transitions
Performed 8128 trivial Post agglomeration. Transition count delta: 8128
Iterating post reduction 0 with 8128 rules applied. Total rules applied 8129 place count 17231 transition count 12999
Reduce places removed 8128 places and 0 transitions.
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Iterating post reduction 1 with 8320 rules applied. Total rules applied 16449 place count 9103 transition count 12807
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 16641 place count 8911 transition count 12807
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16641 place count 8911 transition count 12677
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16901 place count 8781 transition count 12677
Discarding 4030 places :
Symmetric choice reduction at 3 with 4030 rule applications. Total rules 20931 place count 4751 transition count 8647
Iterating global reduction 3 with 4030 rules applied. Total rules applied 24961 place count 4751 transition count 8647
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24961 place count 4751 transition count 8645
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24965 place count 4749 transition count 8645
Applied a total of 24965 rules in 2426 ms. Remains 4749 /17233 variables (removed 12484) and now considering 8645/21129 (removed 12484) transitions.
// Phase 1: matrix 8645 rows 4749 cols
[2023-03-22 05:03:55] [INFO ] Computed 198 place invariants in 85 ms
[2023-03-22 05:03:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:03:58] [INFO ] Implicit Places using invariants in 3273 ms returned [145, 462, 2522, 2557, 2773]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3279 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4744/17233 places, 8645/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4742 transition count 8643
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4742 transition count 8643
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4740 transition count 8641
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4740 transition count 8641
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 39 place count 4709 transition count 8610
Iterating global reduction 0 with 31 rules applied. Total rules applied 70 place count 4709 transition count 8610
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 198 place count 4645 transition count 8546
Applied a total of 198 rules in 3281 ms. Remains 4645 /4744 variables (removed 99) and now considering 8546/8645 (removed 99) transitions.
[2023-03-22 05:04:02] [INFO ] Flow matrix only has 8515 transitions (discarded 31 similar events)
// Phase 1: matrix 8515 rows 4645 cols
[2023-03-22 05:04:02] [INFO ] Computed 193 place invariants in 83 ms
[2023-03-22 05:04:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:04:05] [INFO ] Implicit Places using invariants in 3170 ms returned [911, 1258, 1644, 1854, 3957]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3175 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4640/17233 places, 8546/21129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4635 transition count 8541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4635 transition count 8541
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 4631 transition count 8537
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 4631 transition count 8537
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 144 place count 4505 transition count 8411
Iterating global reduction 0 with 126 rules applied. Total rules applied 270 place count 4505 transition count 8411
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 392 place count 4444 transition count 8350
Applied a total of 392 rules in 2939 ms. Remains 4444 /4640 variables (removed 196) and now considering 8350/8546 (removed 196) transitions.
[2023-03-22 05:04:08] [INFO ] Flow matrix only has 8190 transitions (discarded 160 similar events)
// Phase 1: matrix 8190 rows 4444 cols
[2023-03-22 05:04:08] [INFO ] Computed 188 place invariants in 81 ms
[2023-03-22 05:04:11] [INFO ] Implicit Places using invariants in 2936 ms returned [1253, 2188, 2329, 3281, 3315]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2943 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4439/17233 places, 8350/21129 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 4405 transition count 8316
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 4405 transition count 8316
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 4402 transition count 8313
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 4402 transition count 8313
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 154 place count 4322 transition count 8233
Iterating global reduction 0 with 80 rules applied. Total rules applied 234 place count 4322 transition count 8233
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 0 with 182 rules applied. Total rules applied 416 place count 4231 transition count 8142
Applied a total of 416 rules in 2680 ms. Remains 4231 /4439 variables (removed 208) and now considering 8142/8350 (removed 208) transitions.
[2023-03-22 05:04:13] [INFO ] Flow matrix only has 7899 transitions (discarded 243 similar events)
// Phase 1: matrix 7899 rows 4231 cols
[2023-03-22 05:04:13] [INFO ] Computed 183 place invariants in 72 ms
[2023-03-22 05:04:16] [INFO ] Implicit Places using invariants in 2724 ms returned [270, 668, 2227, 2319, 2752]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2729 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4226/17233 places, 8142/21129 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 4163 transition count 8079
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 4163 transition count 8079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 4161 transition count 8077
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 4161 transition count 8077
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 191 place count 4100 transition count 8016
Iterating global reduction 0 with 61 rules applied. Total rules applied 252 place count 4100 transition count 8016
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 0 with 236 rules applied. Total rules applied 488 place count 3982 transition count 7898
Applied a total of 488 rules in 2405 ms. Remains 3982 /4226 variables (removed 244) and now considering 7898/8142 (removed 244) transitions.
[2023-03-22 05:04:19] [INFO ] Flow matrix only has 7588 transitions (discarded 310 similar events)
// Phase 1: matrix 7588 rows 3982 cols
[2023-03-22 05:04:19] [INFO ] Computed 178 place invariants in 70 ms
[2023-03-22 05:04:23] [INFO ] Implicit Places using invariants in 4118 ms returned [3, 33, 64, 67, 97, 128, 160, 191, 194, 224, 255, 260, 290, 293, 323, 354, 357, 417, 420, 450, 481, 484, 514, 545, 548, 579, 612, 642, 676, 706, 737, 740, 770, 801, 812, 842, 845, 875, 906, 909, 939, 970, 973, 1003, 1034, 1037, 1068, 1101, 1132, 1135, 1165, 1196, 1199, 1229, 1260, 1263, 1293, 1324, 1327, 1357, 1388, 1391, 1422, 1425, 1455, 1486, 1489, 1519, 1550, 1553, 1584, 1587, 1617, 1648, 1651, 1681, 1712, 1715, 1745, 1779, 1809, 1840, 1843, 1873, 1904, 1906, 1908, 1939, 1972, 2002, 2033, 2036, 2066, 2121, 2151, 2182, 2184, 2214, 2217, 2247, 2278, 2280, 2310, 2313, 2343, 2374, 2377, 2407, 2438, 2441, 2471, 2502, 2505, 2535, 2569, 2599, 2630, 2633, 2663, 2694, 2697, 2727, 2758, 2761, 2791, 2822, 2825, 2855, 2886, 2889, 2935, 2965, 2996, 2999, 3029, 3060, 3063, 3093, 3124, 3127, 3157, 3188, 3191, 3221, 3252, 3255, 3285, 3316, 3319, 3349, 3380, 3382, 3412, 3415, 3445, 3476, 3479, 3509, 3543, 3573, 3604, 3607, 3637, 3668, 3671, 3701, 3732, 3735, 3765, 3796, 3799, 3829, 3860]
Discarding 173 places :
Implicit Place search using SMT only with invariants took 4125 ms to find 173 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3809/17233 places, 7898/21129 transitions.
Discarding 3256 places :
Symmetric choice reduction at 0 with 3256 rule applications. Total rules 3256 place count 553 transition count 4642
Iterating global reduction 0 with 3256 rules applied. Total rules applied 6512 place count 553 transition count 4642
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 6629 place count 436 transition count 4525
Iterating global reduction 0 with 117 rules applied. Total rules applied 6746 place count 436 transition count 4525
Discarding 285 places :
Symmetric choice reduction at 0 with 285 rule applications. Total rules 7031 place count 151 transition count 4240
Iterating global reduction 0 with 285 rules applied. Total rules applied 7316 place count 151 transition count 4240
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7320 place count 149 transition count 4238
Applied a total of 7320 rules in 197 ms. Remains 149 /3809 variables (removed 3660) and now considering 4238/7898 (removed 3660) transitions.
[2023-03-22 05:04:23] [INFO ] Flow matrix only has 150 transitions (discarded 4088 similar events)
// Phase 1: matrix 150 rows 149 cols
[2023-03-22 05:04:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 05:04:23] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-22 05:04:23] [INFO ] Flow matrix only has 150 transitions (discarded 4088 similar events)
[2023-03-22 05:04:23] [INFO ] Invariant cache hit.
[2023-03-22 05:04:23] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 149/17233 places, 4238/21129 transitions.
Finished structural reductions in SI_LTL mode , in 6 iterations and 30813 ms. Remains : 149/17233 places, 4238/21129 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(AND (GEQ s39 1) (GEQ s132 1)), p1:(OR (AND (GEQ s28 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s132 1))), p0:(AND (GEQ s69 1) (GEQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-08 finished in 30958 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((F(p0)&&F(!p1)))||(F(p0)&&G(!p1)))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8286 transitions
Trivial Post-agglo rules discarded 8286 transitions
Performed 8286 trivial Post agglomeration. Transition count delta: 8286
Iterating post reduction 0 with 8286 rules applied. Total rules applied 8287 place count 17231 transition count 12841
Reduce places removed 8286 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16605 place count 8945 transition count 12809
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8784 transition count 12680
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20924 place count 4755 transition count 8651
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24953 place count 4755 transition count 8650
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24955 place count 4754 transition count 8650
Applied a total of 24955 rules in 2287 ms. Remains 4754 /17233 variables (removed 12479) and now considering 8650/21129 (removed 12479) transitions.
// Phase 1: matrix 8650 rows 4754 cols
[2023-03-22 05:04:26] [INFO ] Computed 198 place invariants in 87 ms
[2023-03-22 05:04:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:04:29] [INFO ] Implicit Places using invariants in 3144 ms returned [142, 320, 2380, 3697, 4230]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3151 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4749/17233 places, 8650/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4747 transition count 8648
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4747 transition count 8648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4745 transition count 8646
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4745 transition count 8646
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 46 place count 4707 transition count 8608
Iterating global reduction 0 with 38 rules applied. Total rules applied 84 place count 4707 transition count 8608
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 0 with 252 rules applied. Total rules applied 336 place count 4581 transition count 8482
Applied a total of 336 rules in 3244 ms. Remains 4581 /4749 variables (removed 168) and now considering 8482/8650 (removed 168) transitions.
[2023-03-22 05:04:32] [INFO ] Flow matrix only has 8444 transitions (discarded 38 similar events)
// Phase 1: matrix 8444 rows 4581 cols
[2023-03-22 05:04:32] [INFO ] Computed 193 place invariants in 82 ms
[2023-03-22 05:04:35] [INFO ] Implicit Places using invariants in 2964 ms returned [551, 1103, 1175, 2488, 3802]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2983 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4576/17233 places, 8482/21129 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 4511 transition count 8417
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 4511 transition count 8417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 4509 transition count 8415
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 4509 transition count 8415
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 196 place count 4447 transition count 8353
Iterating global reduction 0 with 62 rules applied. Total rules applied 258 place count 4447 transition count 8353
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 0 with 132 rules applied. Total rules applied 390 place count 4381 transition count 8287
Applied a total of 390 rules in 2863 ms. Remains 4381 /4576 variables (removed 195) and now considering 8287/8482 (removed 195) transitions.
[2023-03-22 05:04:38] [INFO ] Flow matrix only has 8185 transitions (discarded 102 similar events)
// Phase 1: matrix 8185 rows 4381 cols
[2023-03-22 05:04:38] [INFO ] Computed 188 place invariants in 79 ms
[2023-03-22 05:04:41] [INFO ] Implicit Places using invariants in 2785 ms returned [903, 2245, 2691, 3458]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2790 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4377/17233 places, 8287/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4374 transition count 8284
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4374 transition count 8284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 4372 transition count 8282
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 4372 transition count 8282
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 72 place count 4310 transition count 8220
Iterating global reduction 0 with 62 rules applied. Total rules applied 134 place count 4310 transition count 8220
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 254 place count 4250 transition count 8160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 255 place count 4249 transition count 8159
Iterating global reduction 0 with 1 rules applied. Total rules applied 256 place count 4249 transition count 8159
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 270 place count 4235 transition count 8145
Iterating global reduction 0 with 14 rules applied. Total rules applied 284 place count 4235 transition count 8145
Applied a total of 284 rules in 3829 ms. Remains 4235 /4377 variables (removed 142) and now considering 8145/8287 (removed 142) transitions.
[2023-03-22 05:04:45] [INFO ] Flow matrix only has 7961 transitions (discarded 184 similar events)
// Phase 1: matrix 7961 rows 4235 cols
[2023-03-22 05:04:45] [INFO ] Computed 184 place invariants in 81 ms
[2023-03-22 05:04:48] [INFO ] Implicit Places using invariants in 2819 ms returned [267, 2896, 3612, 3642, 4109]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2824 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4230/17233 places, 8145/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4227 transition count 8142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4227 transition count 8142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4224 transition count 8139
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4224 transition count 8139
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 75 place count 4161 transition count 8076
Iterating global reduction 0 with 63 rules applied. Total rules applied 138 place count 4161 transition count 8076
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 0 with 114 rules applied. Total rules applied 252 place count 4104 transition count 8019
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 253 place count 4103 transition count 8018
Iterating global reduction 0 with 1 rules applied. Total rules applied 254 place count 4103 transition count 8018
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 298 place count 4059 transition count 7974
Iterating global reduction 0 with 44 rules applied. Total rules applied 342 place count 4059 transition count 7974
Applied a total of 342 rules in 3570 ms. Remains 4059 /4230 variables (removed 171) and now considering 7974/8145 (removed 171) transitions.
[2023-03-22 05:04:51] [INFO ] Flow matrix only has 7673 transitions (discarded 301 similar events)
// Phase 1: matrix 7673 rows 4059 cols
[2023-03-22 05:04:51] [INFO ] Computed 179 place invariants in 73 ms
[2023-03-22 05:04:54] [INFO ] Implicit Places using invariants in 2676 ms returned [453, 583, 651, 1117, 3372]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2681 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4054/17233 places, 7974/21129 transitions.
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 126 place count 3928 transition count 7848
Iterating global reduction 0 with 126 rules applied. Total rules applied 252 place count 3928 transition count 7848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 253 place count 3927 transition count 7847
Iterating global reduction 0 with 1 rules applied. Total rules applied 254 place count 3927 transition count 7847
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 283 place count 3898 transition count 7818
Iterating global reduction 0 with 29 rules applied. Total rules applied 312 place count 3898 transition count 7818
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 438 place count 3835 transition count 7755
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 439 place count 3834 transition count 7754
Iterating global reduction 0 with 1 rules applied. Total rules applied 440 place count 3834 transition count 7754
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 466 place count 3808 transition count 7728
Iterating global reduction 0 with 26 rules applied. Total rules applied 492 place count 3808 transition count 7728
Applied a total of 492 rules in 3008 ms. Remains 3808 /4054 variables (removed 246) and now considering 7728/7974 (removed 246) transitions.
[2023-03-22 05:04:57] [INFO ] Flow matrix only has 7360 transitions (discarded 368 similar events)
// Phase 1: matrix 7360 rows 3808 cols
[2023-03-22 05:04:57] [INFO ] Computed 174 place invariants in 67 ms
[2023-03-22 05:05:01] [INFO ] Implicit Places using invariants in 3940 ms returned [2, 29, 62, 65, 92, 127, 153, 186, 189, 215, 248, 308, 311, 337, 370, 373, 400, 435, 462, 497, 524, 559, 585, 618, 623, 655, 658, 684, 717, 720, 746, 779, 782, 810, 813, 839, 872, 875, 902, 937, 963, 996, 1004, 1038, 1064, 1097, 1100, 1126, 1159, 1162, 1188, 1221, 1224, 1250, 1283, 1286, 1312, 1345, 1348, 1374, 1407, 1410, 1436, 1469, 1472, 1498, 1531, 1534, 1560, 1593, 1596, 1622, 1655, 1658, 1684, 1717, 1720, 1746, 1779, 1782, 1808, 1841, 1844, 1870, 1903, 1905, 1907, 1933, 1966, 1969, 2000, 2028, 2060, 2063, 2090, 2122, 2125, 2155, 2158, 2185, 2217, 2249, 2282, 2285, 2312, 2344, 2347, 2374, 2406, 2423, 2454, 2457, 2484, 2516, 2519, 2546, 2578, 2581, 2608, 2640, 2643, 2680, 2683, 2710, 2742, 2745, 2772, 2804, 2807, 2834, 2866, 2869, 2896, 2928, 2931, 2958, 2990, 2993, 3020, 3055, 3089, 3092, 3119, 3151, 3154, 3184, 3187, 3216, 3219, 3246, 3278, 3283, 3286, 3313, 3345, 3348, 3378, 3381, 3408, 3440, 3443, 3470, 3502, 3505, 3532, 3564, 3567, 3594, 3626, 3629, 3656]
Discarding 171 places :
Implicit Place search using SMT only with invariants took 3946 ms to find 171 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3637/17233 places, 7728/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3637 transition count 7727
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3636 transition count 7727
Discarding 3259 places :
Symmetric choice reduction at 0 with 3259 rule applications. Total rules 3261 place count 377 transition count 4468
Iterating global reduction 0 with 3259 rules applied. Total rules applied 6520 place count 377 transition count 4468
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 6633 place count 264 transition count 4355
Iterating global reduction 0 with 113 rules applied. Total rules applied 6746 place count 264 transition count 4355
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 6859 place count 151 transition count 4242
Iterating global reduction 0 with 113 rules applied. Total rules applied 6972 place count 151 transition count 4242
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6982 place count 146 transition count 4237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6983 place count 145 transition count 4236
Iterating global reduction 0 with 1 rules applied. Total rules applied 6984 place count 145 transition count 4236
Applied a total of 6984 rules in 199 ms. Remains 145 /3637 variables (removed 3492) and now considering 4236/7728 (removed 3492) transitions.
[2023-03-22 05:05:01] [INFO ] Flow matrix only has 175 transitions (discarded 4061 similar events)
// Phase 1: matrix 175 rows 145 cols
[2023-03-22 05:05:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 05:05:01] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-22 05:05:01] [INFO ] Flow matrix only has 175 transitions (discarded 4061 similar events)
[2023-03-22 05:05:01] [INFO ] Invariant cache hit.
[2023-03-22 05:05:02] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 145/17233 places, 4236/21129 transitions.
Finished structural reductions in SI_LTL mode , in 7 iterations and 38042 ms. Remains : 145/17233 places, 4236/21129 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s84 1) (GEQ s86 1)), p0:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-09 finished in 38203 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((G(!p0)||(!p0&&(G(F(!p1))||(F(p2)&&X(F(!p1)))))))))'
Support contains 5 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 69 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 05:05:03] [INFO ] Computed 198 place invariants in 1503 ms
[2023-03-22 05:05:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:05] [INFO ] Implicit Places using invariants in 2903 ms returned []
Implicit Place search using SMT only with invariants took 2904 ms to find 0 implicit places.
[2023-03-22 05:05:05] [INFO ] Invariant cache hit.
[2023-03-22 05:05:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:06] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4306 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, (AND p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2) p1), p0]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (GEQ s1315 1) (GEQ s2648 1)), p2:(GEQ s13708 1), p1:(AND (GEQ s12624 1) (GEQ s15256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9440 reset in 2450 ms.
Product exploration explored 100000 steps with 9454 reset in 2449 ms.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
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) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 9 factoid took 372 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-11 finished in 27891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((F(G(p2))&&p1))))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 05:05:30] [INFO ] Invariant cache hit.
[2023-03-22 05:05:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:31] [INFO ] Implicit Places using invariants in 1356 ms returned []
Implicit Place search using SMT only with invariants took 1357 ms to find 0 implicit places.
[2023-03-22 05:05:31] [INFO ] Invariant cache hit.
[2023-03-22 05:05:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:32] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2758 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 p1) (AND p1 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s15557 1), p1:(AND (GEQ s5786 1) (GEQ s15604 1)), p2:(GEQ s8460 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-13 finished in 3009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0)) U p1)&&F(G(p2)))))'
Support contains 5 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 05:05:33] [INFO ] Invariant cache hit.
[2023-03-22 05:05:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:34] [INFO ] Implicit Places using invariants in 1338 ms returned []
Implicit Place search using SMT only with invariants took 1339 ms to find 0 implicit places.
[2023-03-22 05:05:34] [INFO ] Invariant cache hit.
[2023-03-22 05:05:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:35] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2749 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s897 1) (GEQ s1048 1)), p0:(GEQ s9891 1), p2:(OR (LT s6002 1) (LT s6047 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-14 finished in 3076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U p1)))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 67 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 05:05:36] [INFO ] Invariant cache hit.
[2023-03-22 05:05:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:37] [INFO ] Implicit Places using invariants in 1359 ms returned []
Implicit Place search using SMT only with invariants took 1371 ms to find 0 implicit places.
[2023-03-22 05:05:37] [INFO ] Invariant cache hit.
[2023-03-22 05:05:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 05:05:39] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2781 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s5994 1) (GEQ s6047 1)), p0:(AND (GEQ s3862 1) (GEQ s3943 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-15 finished in 3009 ms.
All properties solved by simple procedures.
Total runtime 238789 ms.
ITS solved all properties within timeout
BK_STOP 1679461540518
--------------------
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 LTLFireability -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-S64C2"
export BK_EXAMINATION="LTLFireability"
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-S64C2, examination is LTLFireability"
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-167856416200524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;