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.r169-tall-167838855800396.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 ltsminxred
Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 23K Feb 26 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 162K Feb 26 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 180K Feb 26 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 552K 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 FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678533919847

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 11:25:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 11:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 11:25:21] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-11 11:25:21] [INFO ] Transformed 1475 places.
[2023-03-11 11:25:21] [INFO ] Transformed 1234 transitions.
[2023-03-11 11:25:21] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 338 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 130 places :
Implicit places reduction removed 130 places
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 1290 transition count 1234
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 263 place count 1202 transition count 1146
Iterating global reduction 1 with 88 rules applied. Total rules applied 351 place count 1202 transition count 1146
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 362 place count 1191 transition count 1146
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 373 place count 1180 transition count 1135
Iterating global reduction 2 with 11 rules applied. Total rules applied 384 place count 1180 transition count 1135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 395 place count 1169 transition count 1124
Iterating global reduction 2 with 11 rules applied. Total rules applied 406 place count 1169 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 407 place count 1168 transition count 1113
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 1168 transition count 1113
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 419 place count 1157 transition count 1113
Applied a total of 419 rules in 343 ms. Remains 1157 /1465 variables (removed 308) and now considering 1113/1234 (removed 121) transitions.
// Phase 1: matrix 1113 rows 1157 cols
[2023-03-11 11:25:21] [INFO ] Computed 150 place invariants in 53 ms
[2023-03-11 11:25:23] [INFO ] Implicit Places using invariants in 1122 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 613, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 857, 858, 859, 860, 861, 862, 863, 864, 865, 867]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1147 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1091/1465 places, 1113/1234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1081 transition count 1103
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1081 transition count 1103
Applied a total of 20 rules in 83 ms. Remains 1081 /1091 variables (removed 10) and now considering 1103/1113 (removed 10) transitions.
// Phase 1: matrix 1103 rows 1081 cols
[2023-03-11 11:25:23] [INFO ] Computed 84 place invariants in 16 ms
[2023-03-11 11:25:23] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 11:25:23] [INFO ] Invariant cache hit.
[2023-03-11 11:25:24] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1081/1465 places, 1103/1234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2447 ms. Remains : 1081/1465 places, 1103/1234 transitions.
Support contains 338 out of 1081 places after structural reductions.
[2023-03-11 11:25:24] [INFO ] Flatten gal took : 78 ms
[2023-03-11 11:25:24] [INFO ] Flatten gal took : 49 ms
[2023-03-11 11:25:24] [INFO ] Input system was already deterministic with 1103 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 35) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 11:25:24] [INFO ] Invariant cache hit.
[2023-03-11 11:25:24] [INFO ] [Real]Absence check using 0 positive and 84 generalized place invariants in 40 ms returned sat
[2023-03-11 11:25:25] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 11:25:25] [INFO ] [Nat]Absence check using 0 positive and 84 generalized place invariants in 34 ms returned sat
[2023-03-11 11:25:26] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 11:25:26] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-11 11:25:26] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 491 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 15 ms.
Computed a total of 1081 stabilizing places and 1103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1081 transition count 1103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G((p1||F(p2)))||(!p1 U X(p2)))&&p0)))'
Support contains 44 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 58 place count 1023 transition count 1036
Iterating global reduction 1 with 56 rules applied. Total rules applied 114 place count 1023 transition count 1036
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 125 place count 1023 transition count 1025
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 139 place count 1009 transition count 981
Iterating global reduction 2 with 14 rules applied. Total rules applied 153 place count 1009 transition count 981
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 164 place count 998 transition count 981
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 207 place count 955 transition count 938
Iterating global reduction 3 with 43 rules applied. Total rules applied 250 place count 955 transition count 938
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 261 place count 955 transition count 927
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 283 place count 933 transition count 885
Iterating global reduction 4 with 22 rules applied. Total rules applied 305 place count 933 transition count 885
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 315 place count 923 transition count 875
Iterating global reduction 4 with 10 rules applied. Total rules applied 325 place count 923 transition count 875
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 335 place count 913 transition count 865
Iterating global reduction 4 with 10 rules applied. Total rules applied 345 place count 913 transition count 865
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 355 place count 903 transition count 855
Iterating global reduction 4 with 10 rules applied. Total rules applied 365 place count 903 transition count 855
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 375 place count 893 transition count 845
Iterating global reduction 4 with 10 rules applied. Total rules applied 385 place count 893 transition count 845
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 386 place count 892 transition count 845
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 396 place count 882 transition count 835
Iterating global reduction 5 with 10 rules applied. Total rules applied 406 place count 882 transition count 835
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 416 place count 872 transition count 825
Iterating global reduction 5 with 10 rules applied. Total rules applied 426 place count 872 transition count 825
Applied a total of 426 rules in 432 ms. Remains 872 /1081 variables (removed 209) and now considering 825/1103 (removed 278) transitions.
// Phase 1: matrix 825 rows 872 cols
[2023-03-11 11:25:27] [INFO ] Computed 70 place invariants in 15 ms
[2023-03-11 11:25:27] [INFO ] Implicit Places using invariants in 197 ms returned [176, 628, 772]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 200 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 869/1081 places, 825/1103 transitions.
Applied a total of 0 rules in 22 ms. Remains 869 /869 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 869/1081 places, 825/1103 transitions.
Stuttering acceptance computed with spot in 997 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s438 1) (LT s437 1) (LT s436 1) (LT s457 1) (LT s456 1) (LT s455 1) (LT s450 1) (LT s449 1) (LT s448 1) (LT s447 1) (LT s454 1) (LT s453 1) (L...], 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]]
Product exploration explored 100000 steps with 387 reset in 497 ms.
Product exploration explored 100000 steps with 388 reset in 403 ms.
Computed a total of 869 stabilizing places and 825 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 869 transition count 825
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 22 factoid took 2025 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 finished in 4803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 11 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 1012 transition count 1025
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 1012 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 147 place count 1012 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 172 place count 987 transition count 959
Iterating global reduction 2 with 25 rules applied. Total rules applied 197 place count 987 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 976 transition count 959
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 262 place count 922 transition count 905
Iterating global reduction 3 with 54 rules applied. Total rules applied 316 place count 922 transition count 905
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 327 place count 922 transition count 894
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 360 place count 889 transition count 841
Iterating global reduction 4 with 33 rules applied. Total rules applied 393 place count 889 transition count 841
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 414 place count 868 transition count 820
Iterating global reduction 4 with 21 rules applied. Total rules applied 435 place count 868 transition count 820
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 456 place count 847 transition count 799
Iterating global reduction 4 with 21 rules applied. Total rules applied 477 place count 847 transition count 799
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 498 place count 826 transition count 778
Iterating global reduction 4 with 21 rules applied. Total rules applied 519 place count 826 transition count 778
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 540 place count 805 transition count 757
Iterating global reduction 4 with 21 rules applied. Total rules applied 561 place count 805 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 804 transition count 757
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 583 place count 783 transition count 736
Iterating global reduction 5 with 21 rules applied. Total rules applied 604 place count 783 transition count 736
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 625 place count 762 transition count 715
Iterating global reduction 5 with 21 rules applied. Total rules applied 646 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 657 place count 751 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 668 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 679 place count 740 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 690 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 701 place count 729 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 712 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 723 place count 729 transition count 671
Applied a total of 723 rules in 339 ms. Remains 729 /1081 variables (removed 352) and now considering 671/1103 (removed 432) transitions.
// Phase 1: matrix 671 rows 729 cols
[2023-03-11 11:25:31] [INFO ] Computed 70 place invariants in 9 ms
[2023-03-11 11:25:31] [INFO ] Implicit Places using invariants in 148 ms returned [143, 485, 629]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 150 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1081 places, 671/1103 transitions.
Applied a total of 0 rules in 16 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 726/1081 places, 671/1103 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s368 1) (GEQ s367 1) (GEQ s370 1) (GEQ s369 1) (GEQ s364 1) (GEQ s363 1) (GEQ s366 1) (GEQ s365 1) (GEQ s362 1) (GEQ s372 1) (GEQ s371 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][false, false, false]]
Product exploration explored 100000 steps with 559 reset in 172 ms.
Product exploration explored 100000 steps with 564 reset in 183 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1407 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 172 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:25:34] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-11 11:25:34] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:25:34] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-11 11:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:25:35] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 17 ms returned sat
[2023-03-11 11:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:25:35] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-11 11:25:35] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 32 ms.
[2023-03-11 11:25:37] [INFO ] Added : 231 causal constraints over 47 iterations in 1693 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 16 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2023-03-11 11:25:37] [INFO ] Invariant cache hit.
[2023-03-11 11:25:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 11:25:37] [INFO ] Invariant cache hit.
[2023-03-11 11:25:37] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-11 11:25:37] [INFO ] Invariant cache hit.
[2023-03-11 11:25:37] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 726/726 places, 671/671 transitions.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1353 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 189 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 11:25:39] [INFO ] Invariant cache hit.
[2023-03-11 11:25:40] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 17 ms returned sat
[2023-03-11 11:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:25:40] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-11 11:25:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:25:40] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 17 ms returned sat
[2023-03-11 11:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:25:40] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-11 11:25:41] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 36 ms.
[2023-03-11 11:25:42] [INFO ] Added : 231 causal constraints over 47 iterations in 1678 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 591 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 560 reset in 175 ms.
Product exploration explored 100000 steps with 561 reset in 184 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Graph (complete) has 814 edges and 726 vertex of which 264 are kept as prefixes of interest. Removing 462 places using SCC suffix rule.6 ms
Discarding 462 places :
Also discarding 407 output transitions
Drop transitions removed 407 transitions
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 264 transition count 264
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 122 place count 264 transition count 264
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 243 place count 264 transition count 264
Discarding 231 places :
Symmetric choice reduction at 1 with 231 rule applications. Total rules 474 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 231 rules applied. Total rules applied 705 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 705 rules in 45 ms. Remains 33 /726 variables (removed 693) and now considering 33/671 (removed 638) transitions.
[2023-03-11 11:25:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 33 cols
[2023-03-11 11:25:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 11:25:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/726 places, 33/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 33/726 places, 33/671 transitions.
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 31 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:25:43] [INFO ] Computed 67 place invariants in 9 ms
[2023-03-11 11:25:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-11 11:25:44] [INFO ] Invariant cache hit.
[2023-03-11 11:25:44] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-11 11:25:44] [INFO ] Invariant cache hit.
[2023-03-11 11:25:44] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 726/726 places, 671/671 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 finished in 13385 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&&(X(p2)||p1)))))'
Support contains 22 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 1012 transition count 1025
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 1012 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 147 place count 1012 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 172 place count 987 transition count 959
Iterating global reduction 2 with 25 rules applied. Total rules applied 197 place count 987 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 976 transition count 959
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 262 place count 922 transition count 905
Iterating global reduction 3 with 54 rules applied. Total rules applied 316 place count 922 transition count 905
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 327 place count 922 transition count 894
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 360 place count 889 transition count 841
Iterating global reduction 4 with 33 rules applied. Total rules applied 393 place count 889 transition count 841
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 414 place count 868 transition count 820
Iterating global reduction 4 with 21 rules applied. Total rules applied 435 place count 868 transition count 820
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 456 place count 847 transition count 799
Iterating global reduction 4 with 21 rules applied. Total rules applied 477 place count 847 transition count 799
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 498 place count 826 transition count 778
Iterating global reduction 4 with 21 rules applied. Total rules applied 519 place count 826 transition count 778
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 540 place count 805 transition count 757
Iterating global reduction 4 with 21 rules applied. Total rules applied 561 place count 805 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 804 transition count 757
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 583 place count 783 transition count 736
Iterating global reduction 5 with 21 rules applied. Total rules applied 604 place count 783 transition count 736
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 625 place count 762 transition count 715
Iterating global reduction 5 with 21 rules applied. Total rules applied 646 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 657 place count 751 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 668 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 679 place count 740 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 690 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 701 place count 729 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 712 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 723 place count 729 transition count 671
Applied a total of 723 rules in 289 ms. Remains 729 /1081 variables (removed 352) and now considering 671/1103 (removed 432) transitions.
// Phase 1: matrix 671 rows 729 cols
[2023-03-11 11:25:45] [INFO ] Computed 70 place invariants in 7 ms
[2023-03-11 11:25:45] [INFO ] Implicit Places using invariants in 181 ms returned [143, 485, 629]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 183 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1081 places, 671/1103 transitions.
Applied a total of 0 rules in 14 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 726/1081 places, 671/1103 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s347 1) (GEQ s346 1) (GEQ s349 1) (GEQ s348 1) (GEQ s343 1) (GEQ s342 1) (GEQ s345 1) (GEQ s344 1) (GEQ s340 1) (GEQ s341 1) (GEQ s350 1)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 645 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 44 out of 1081 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Graph (complete) has 1427 edges and 1081 vertex of which 1046 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.7 ms
Discarding 35 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 584 rules applied. Total rules applied 585 place count 1033 transition count 475
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 615 rules applied. Total rules applied 1200 place count 473 transition count 420
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1233 place count 440 transition count 420
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 1233 place count 440 transition count 300
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 1506 place count 287 transition count 300
Discarding 22 places :
Implicit places reduction removed 22 places
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 44 rules applied. Total rules applied 1550 place count 265 transition count 278
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1572 place count 243 transition count 278
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1572 place count 243 transition count 267
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1594 place count 232 transition count 267
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1617 place count 209 transition count 244
Iterating global reduction 5 with 23 rules applied. Total rules applied 1640 place count 209 transition count 244
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1641 place count 209 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1642 place count 208 transition count 243
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1642 place count 208 transition count 221
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1686 place count 186 transition count 221
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1688 place count 184 transition count 199
Iterating global reduction 7 with 2 rules applied. Total rules applied 1690 place count 184 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 33 rules applied. Total rules applied 1723 place count 173 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1734 place count 162 transition count 177
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1734 place count 162 transition count 166
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1756 place count 151 transition count 166
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1780 place count 139 transition count 154
Applied a total of 1780 rules in 66 ms. Remains 139 /1081 variables (removed 942) and now considering 154/1103 (removed 949) transitions.
// Phase 1: matrix 154 rows 139 cols
[2023-03-11 11:25:45] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 11:25:45] [INFO ] Implicit Places using invariants in 57 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 82, 127]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 58 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/1081 places, 154/1103 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 125 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 114 transition count 143
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 114 transition count 132
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 103 transition count 132
Applied a total of 44 rules in 6 ms. Remains 103 /125 variables (removed 22) and now considering 132/154 (removed 22) transitions.
// Phase 1: matrix 132 rows 103 cols
[2023-03-11 11:25:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 11:25:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 11:25:45] [INFO ] Invariant cache hit.
[2023-03-11 11:25:45] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/1081 places, 132/1103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 103/1081 places, 132/1103 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s30 1) (GEQ s35 1) (GEQ s35 1) (GEQ s30 1) (GEQ s44 1) (GEQ s34 1) (GEQ s44 1) (GEQ s40 1) (GEQ s40 1) (GEQ s36 1) (GEQ s41 1) (GEQ s46 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2500 reset in 397 ms.
Product exploration explored 100000 steps with 2500 reset in 383 ms.
Computed a total of 103 stabilizing places and 132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 103 transition count 132
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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 8 factoid took 269 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 finished in 1437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 44 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 47 place count 1034 transition count 1047
Iterating global reduction 1 with 45 rules applied. Total rules applied 92 place count 1034 transition count 1047
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 1034 transition count 1036
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 116 place count 1021 transition count 1003
Iterating global reduction 2 with 13 rules applied. Total rules applied 129 place count 1021 transition count 1003
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 140 place count 1010 transition count 1003
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 173 place count 977 transition count 970
Iterating global reduction 3 with 33 rules applied. Total rules applied 206 place count 977 transition count 970
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 229 place count 954 transition count 937
Iterating global reduction 3 with 23 rules applied. Total rules applied 252 place count 954 transition count 937
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 263 place count 943 transition count 926
Iterating global reduction 3 with 11 rules applied. Total rules applied 274 place count 943 transition count 926
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 285 place count 932 transition count 915
Iterating global reduction 3 with 11 rules applied. Total rules applied 296 place count 932 transition count 915
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 307 place count 921 transition count 904
Iterating global reduction 3 with 11 rules applied. Total rules applied 318 place count 921 transition count 904
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 329 place count 910 transition count 893
Iterating global reduction 3 with 11 rules applied. Total rules applied 340 place count 910 transition count 893
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 351 place count 899 transition count 882
Iterating global reduction 3 with 11 rules applied. Total rules applied 362 place count 899 transition count 882
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 373 place count 888 transition count 871
Iterating global reduction 3 with 11 rules applied. Total rules applied 384 place count 888 transition count 871
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 395 place count 877 transition count 860
Iterating global reduction 3 with 11 rules applied. Total rules applied 406 place count 877 transition count 860
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 417 place count 866 transition count 849
Iterating global reduction 3 with 11 rules applied. Total rules applied 428 place count 866 transition count 849
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 439 place count 855 transition count 838
Iterating global reduction 3 with 11 rules applied. Total rules applied 450 place count 855 transition count 838
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 461 place count 855 transition count 827
Applied a total of 461 rules in 252 ms. Remains 855 /1081 variables (removed 226) and now considering 827/1103 (removed 276) transitions.
// Phase 1: matrix 827 rows 855 cols
[2023-03-11 11:25:47] [INFO ] Computed 71 place invariants in 11 ms
[2023-03-11 11:25:47] [INFO ] Implicit Places using invariants in 174 ms returned [366, 611, 755]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 175 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 852/1081 places, 827/1103 transitions.
Applied a total of 0 rules in 15 ms. Remains 852 /852 variables (removed 0) and now considering 827/827 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 443 ms. Remains : 852/1081 places, 827/1103 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s521 1) (LT s519 1) (LT s520 1) (LT s517 1) (LT s518 1) (LT s515 1) (LT s516 1) (LT s513 1) (LT s514 1) (LT s511 1) (LT s512 1)), p1:(OR (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 521 ms.
Computed a total of 852 stabilizing places and 827 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 852 transition count 827
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), true, (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 3980 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 finished in 5737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(!(!p0 U !p1))||X((F(p3)||p2)))))'
Support contains 66 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 58 place count 1023 transition count 1036
Iterating global reduction 1 with 56 rules applied. Total rules applied 114 place count 1023 transition count 1036
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 125 place count 1023 transition count 1025
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 149 place count 999 transition count 981
Iterating global reduction 2 with 24 rules applied. Total rules applied 173 place count 999 transition count 981
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 216 place count 956 transition count 938
Iterating global reduction 2 with 43 rules applied. Total rules applied 259 place count 956 transition count 938
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 270 place count 956 transition count 927
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 292 place count 934 transition count 885
Iterating global reduction 3 with 22 rules applied. Total rules applied 314 place count 934 transition count 885
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 335 place count 913 transition count 864
Iterating global reduction 3 with 21 rules applied. Total rules applied 356 place count 913 transition count 864
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 367 place count 902 transition count 853
Iterating global reduction 3 with 11 rules applied. Total rules applied 378 place count 902 transition count 853
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 389 place count 891 transition count 842
Iterating global reduction 3 with 11 rules applied. Total rules applied 400 place count 891 transition count 842
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 411 place count 880 transition count 831
Iterating global reduction 3 with 11 rules applied. Total rules applied 422 place count 880 transition count 831
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 433 place count 869 transition count 820
Iterating global reduction 3 with 11 rules applied. Total rules applied 444 place count 869 transition count 820
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 455 place count 858 transition count 809
Iterating global reduction 3 with 11 rules applied. Total rules applied 466 place count 858 transition count 809
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 477 place count 847 transition count 798
Iterating global reduction 3 with 11 rules applied. Total rules applied 488 place count 847 transition count 798
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 499 place count 836 transition count 787
Iterating global reduction 3 with 11 rules applied. Total rules applied 510 place count 836 transition count 787
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 521 place count 825 transition count 776
Iterating global reduction 3 with 11 rules applied. Total rules applied 532 place count 825 transition count 776
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 543 place count 825 transition count 765
Applied a total of 543 rules in 241 ms. Remains 825 /1081 variables (removed 256) and now considering 765/1103 (removed 338) transitions.
// Phase 1: matrix 765 rows 825 cols
[2023-03-11 11:25:52] [INFO ] Computed 82 place invariants in 10 ms
[2023-03-11 11:25:53] [INFO ] Implicit Places using invariants in 171 ms returned [143, 343, 536]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 172 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 822/1081 places, 765/1103 transitions.
Applied a total of 0 rules in 13 ms. Remains 822 /822 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 822/1081 places, 765/1103 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s729 1) (GEQ s751 1)) (AND (GEQ s727 1) (GEQ s760 1)) (AND (GEQ s730 1) (GEQ s763 1)) (AND (GEQ s733 1) (GEQ s766 1)) (AND (GEQ s725 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 655 ms.
Product exploration explored 100000 steps with 50000 reset in 669 ms.
Computed a total of 822 stabilizing places and 765 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 822 transition count 765
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 p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))
Knowledge based reduction with 12 factoid took 809 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 finished in 2957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 46 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 58 place count 1023 transition count 1036
Iterating global reduction 1 with 56 rules applied. Total rules applied 114 place count 1023 transition count 1036
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 125 place count 1023 transition count 1025
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 138 place count 1010 transition count 992
Iterating global reduction 2 with 13 rules applied. Total rules applied 151 place count 1010 transition count 992
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 162 place count 999 transition count 992
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 194 place count 967 transition count 960
Iterating global reduction 3 with 32 rules applied. Total rules applied 226 place count 967 transition count 960
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 237 place count 967 transition count 949
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 258 place count 946 transition count 918
Iterating global reduction 4 with 21 rules applied. Total rules applied 279 place count 946 transition count 918
Applied a total of 279 rules in 111 ms. Remains 946 /1081 variables (removed 135) and now considering 918/1103 (removed 185) transitions.
// Phase 1: matrix 918 rows 946 cols
[2023-03-11 11:25:55] [INFO ] Computed 71 place invariants in 10 ms
[2023-03-11 11:25:55] [INFO ] Implicit Places using invariants in 184 ms returned [176, 702, 846]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 185 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 943/1081 places, 918/1103 transitions.
Applied a total of 0 rules in 19 ms. Remains 943 /943 variables (removed 0) and now considering 918/918 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 317 ms. Remains : 943/1081 places, 918/1103 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (LT s636 1) (LT s635 1) (LT s641 1) (LT s642 1) (LT s643 1) (LT s644 1) (LT s645 1) (LT s640 1) (LT s639 1) (LT s638 1) (LT s637 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 168 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(p1)))))'
Support contains 88 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 58 place count 1023 transition count 1036
Iterating global reduction 1 with 56 rules applied. Total rules applied 114 place count 1023 transition count 1036
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 139 place count 998 transition count 981
Iterating global reduction 1 with 25 rules applied. Total rules applied 164 place count 998 transition count 981
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 175 place count 987 transition count 981
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 229 place count 933 transition count 927
Iterating global reduction 2 with 54 rules applied. Total rules applied 283 place count 933 transition count 927
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 294 place count 933 transition count 916
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 316 place count 911 transition count 874
Iterating global reduction 3 with 22 rules applied. Total rules applied 338 place count 911 transition count 874
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 359 place count 890 transition count 853
Iterating global reduction 3 with 21 rules applied. Total rules applied 380 place count 890 transition count 853
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 401 place count 869 transition count 832
Iterating global reduction 3 with 21 rules applied. Total rules applied 422 place count 869 transition count 832
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 443 place count 848 transition count 811
Iterating global reduction 3 with 21 rules applied. Total rules applied 464 place count 848 transition count 811
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 485 place count 827 transition count 790
Iterating global reduction 3 with 21 rules applied. Total rules applied 506 place count 827 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 507 place count 826 transition count 790
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 528 place count 805 transition count 769
Iterating global reduction 4 with 21 rules applied. Total rules applied 549 place count 805 transition count 769
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 570 place count 784 transition count 748
Iterating global reduction 4 with 21 rules applied. Total rules applied 591 place count 784 transition count 748
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 602 place count 773 transition count 737
Iterating global reduction 4 with 11 rules applied. Total rules applied 613 place count 773 transition count 737
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 624 place count 762 transition count 726
Iterating global reduction 4 with 11 rules applied. Total rules applied 635 place count 762 transition count 726
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 646 place count 751 transition count 715
Iterating global reduction 4 with 11 rules applied. Total rules applied 657 place count 751 transition count 715
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 668 place count 751 transition count 704
Applied a total of 668 rules in 219 ms. Remains 751 /1081 variables (removed 330) and now considering 704/1103 (removed 399) transitions.
// Phase 1: matrix 704 rows 751 cols
[2023-03-11 11:25:56] [INFO ] Computed 70 place invariants in 7 ms
[2023-03-11 11:25:56] [INFO ] Implicit Places using invariants in 140 ms returned [143, 496, 651]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 140 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 748/1081 places, 704/1103 transitions.
Applied a total of 0 rules in 10 ms. Remains 748 /748 variables (removed 0) and now considering 704/704 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 748/1081 places, 704/1103 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(AND (OR (LT s586 1) (LT s608 1)) (OR (LT s578 1) (LT s600 1)) (OR (LT s591 1) (LT s613 1)) (OR (LT s589 1) (LT s611 1)) (OR (LT s593 1) (LT s615 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 325 ms.
Product exploration explored 100000 steps with 25000 reset in 333 ms.
Computed a total of 748 stabilizing places and 704 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 748 transition count 704
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 210 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2874 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 66 out of 748 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 748/748 places, 704/704 transitions.
Applied a total of 0 rules in 20 ms. Remains 748 /748 variables (removed 0) and now considering 704/704 (removed 0) transitions.
// Phase 1: matrix 704 rows 748 cols
[2023-03-11 11:26:01] [INFO ] Computed 67 place invariants in 4 ms
[2023-03-11 11:26:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 11:26:01] [INFO ] Invariant cache hit.
[2023-03-11 11:26:01] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-11 11:26:01] [INFO ] Invariant cache hit.
[2023-03-11 11:26:01] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 748/748 places, 704/704 transitions.
Computed a total of 748 stabilizing places and 704 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 748 transition count 704
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 : [p1, true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 223 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
Knowledge obtained : [p1, true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 300 ms.
Product exploration explored 100000 steps with 25000 reset in 308 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 66 out of 748 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 748/748 places, 704/704 transitions.
Graph (complete) has 858 edges and 748 vertex of which 462 are kept as prefixes of interest. Removing 286 places using SCC suffix rule.4 ms
Discarding 286 places :
Also discarding 242 output transitions
Drop transitions removed 242 transitions
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 165 rules applied. Total rules applied 166 place count 462 transition count 462
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 143 Pre rules applied. Total rules applied 166 place count 462 transition count 462
Deduced a syphon composed of 308 places in 0 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 309 place count 462 transition count 462
Discarding 264 places :
Symmetric choice reduction at 1 with 264 rule applications. Total rules 573 place count 198 transition count 198
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 264 rules applied. Total rules applied 837 place count 198 transition count 198
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 848 place count 198 transition count 198
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 859 place count 187 transition count 187
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 870 place count 187 transition count 187
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 881 place count 187 transition count 220
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 892 place count 176 transition count 198
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 903 place count 176 transition count 198
Performed 11(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 914 place count 176 transition count 220
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 925 place count 165 transition count 198
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 936 place count 165 transition count 198
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 936 rules in 39 ms. Remains 165 /748 variables (removed 583) and now considering 198/704 (removed 506) transitions.
[2023-03-11 11:26:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 198 rows 165 cols
[2023-03-11 11:26:03] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 11:26:03] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/748 places, 198/704 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 165/748 places, 198/704 transitions.
Support contains 66 out of 748 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 748/748 places, 704/704 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 737 transition count 693
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 737 transition count 693
Applied a total of 22 rules in 24 ms. Remains 737 /748 variables (removed 11) and now considering 693/704 (removed 11) transitions.
// Phase 1: matrix 693 rows 737 cols
[2023-03-11 11:26:03] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-11 11:26:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 11:26:04] [INFO ] Invariant cache hit.
[2023-03-11 11:26:04] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-11 11:26:04] [INFO ] Invariant cache hit.
[2023-03-11 11:26:04] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 737/748 places, 693/704 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 737/748 places, 693/704 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 finished in 8705 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)&&(p1||G(p2))))))'
Support contains 3 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 1012 transition count 1025
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 1012 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 147 place count 1012 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 172 place count 987 transition count 959
Iterating global reduction 2 with 25 rules applied. Total rules applied 197 place count 987 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 976 transition count 959
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 261 place count 923 transition count 906
Iterating global reduction 3 with 53 rules applied. Total rules applied 314 place count 923 transition count 906
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 325 place count 923 transition count 895
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 357 place count 891 transition count 853
Iterating global reduction 4 with 32 rules applied. Total rules applied 389 place count 891 transition count 853
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 410 place count 870 transition count 832
Iterating global reduction 4 with 21 rules applied. Total rules applied 431 place count 870 transition count 832
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 452 place count 849 transition count 811
Iterating global reduction 4 with 21 rules applied. Total rules applied 473 place count 849 transition count 811
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 494 place count 828 transition count 790
Iterating global reduction 4 with 21 rules applied. Total rules applied 515 place count 828 transition count 790
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 536 place count 807 transition count 769
Iterating global reduction 4 with 21 rules applied. Total rules applied 557 place count 807 transition count 769
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 577 place count 787 transition count 740
Iterating global reduction 4 with 20 rules applied. Total rules applied 597 place count 787 transition count 740
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 617 place count 767 transition count 720
Iterating global reduction 4 with 20 rules applied. Total rules applied 637 place count 767 transition count 720
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 648 place count 756 transition count 709
Iterating global reduction 4 with 11 rules applied. Total rules applied 659 place count 756 transition count 709
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 670 place count 745 transition count 698
Iterating global reduction 4 with 11 rules applied. Total rules applied 681 place count 745 transition count 698
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 692 place count 734 transition count 687
Iterating global reduction 4 with 11 rules applied. Total rules applied 703 place count 734 transition count 687
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 714 place count 734 transition count 676
Applied a total of 714 rules in 237 ms. Remains 734 /1081 variables (removed 347) and now considering 676/1103 (removed 427) transitions.
// Phase 1: matrix 676 rows 734 cols
[2023-03-11 11:26:04] [INFO ] Computed 71 place invariants in 8 ms
[2023-03-11 11:26:05] [INFO ] Implicit Places using invariants in 163 ms returned [143, 297, 490, 634]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 164 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/1081 places, 676/1103 transitions.
Applied a total of 0 rules in 13 ms. Remains 730 /730 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 730/1081 places, 676/1103 transitions.
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s560 1), p2:(GEQ s48 1), p0:(AND (GEQ s295 1) (LT s48 1))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 finished in 959 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(F(p1))&&p0)))'
Support contains 3 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 68 place count 1013 transition count 1026
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 1013 transition count 1026
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 145 place count 1013 transition count 1015
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 170 place count 988 transition count 960
Iterating global reduction 2 with 25 rules applied. Total rules applied 195 place count 988 transition count 960
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 206 place count 977 transition count 960
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 259 place count 924 transition count 907
Iterating global reduction 3 with 53 rules applied. Total rules applied 312 place count 924 transition count 907
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 323 place count 924 transition count 896
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 355 place count 892 transition count 844
Iterating global reduction 4 with 32 rules applied. Total rules applied 387 place count 892 transition count 844
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 408 place count 871 transition count 823
Iterating global reduction 4 with 21 rules applied. Total rules applied 429 place count 871 transition count 823
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 450 place count 850 transition count 802
Iterating global reduction 4 with 21 rules applied. Total rules applied 471 place count 850 transition count 802
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 492 place count 829 transition count 781
Iterating global reduction 4 with 21 rules applied. Total rules applied 513 place count 829 transition count 781
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 534 place count 808 transition count 760
Iterating global reduction 4 with 21 rules applied. Total rules applied 555 place count 808 transition count 760
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 556 place count 807 transition count 760
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 577 place count 786 transition count 739
Iterating global reduction 5 with 21 rules applied. Total rules applied 598 place count 786 transition count 739
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 619 place count 765 transition count 718
Iterating global reduction 5 with 21 rules applied. Total rules applied 640 place count 765 transition count 718
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 651 place count 754 transition count 707
Iterating global reduction 5 with 11 rules applied. Total rules applied 662 place count 754 transition count 707
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 673 place count 743 transition count 696
Iterating global reduction 5 with 11 rules applied. Total rules applied 684 place count 743 transition count 696
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 694 place count 733 transition count 686
Iterating global reduction 5 with 10 rules applied. Total rules applied 704 place count 733 transition count 686
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 714 place count 733 transition count 676
Applied a total of 714 rules in 243 ms. Remains 733 /1081 variables (removed 348) and now considering 676/1103 (removed 427) transitions.
// Phase 1: matrix 676 rows 733 cols
[2023-03-11 11:26:05] [INFO ] Computed 70 place invariants in 10 ms
[2023-03-11 11:26:06] [INFO ] Implicit Places using invariants in 161 ms returned [144, 632]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 162 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/1081 places, 676/1103 transitions.
Applied a total of 0 rules in 13 ms. Remains 731 /731 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 731/1081 places, 676/1103 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s485 1) (GEQ s640 1)), p1:(LT s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 643 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 1012 transition count 1025
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 1012 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 147 place count 1012 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 172 place count 987 transition count 959
Iterating global reduction 2 with 25 rules applied. Total rules applied 197 place count 987 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 976 transition count 959
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 262 place count 922 transition count 905
Iterating global reduction 3 with 54 rules applied. Total rules applied 316 place count 922 transition count 905
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 327 place count 922 transition count 894
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 360 place count 889 transition count 841
Iterating global reduction 4 with 33 rules applied. Total rules applied 393 place count 889 transition count 841
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 414 place count 868 transition count 820
Iterating global reduction 4 with 21 rules applied. Total rules applied 435 place count 868 transition count 820
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 456 place count 847 transition count 799
Iterating global reduction 4 with 21 rules applied. Total rules applied 477 place count 847 transition count 799
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 498 place count 826 transition count 778
Iterating global reduction 4 with 21 rules applied. Total rules applied 519 place count 826 transition count 778
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 540 place count 805 transition count 757
Iterating global reduction 4 with 21 rules applied. Total rules applied 561 place count 805 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 804 transition count 757
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 583 place count 783 transition count 736
Iterating global reduction 5 with 21 rules applied. Total rules applied 604 place count 783 transition count 736
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 625 place count 762 transition count 715
Iterating global reduction 5 with 21 rules applied. Total rules applied 646 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 657 place count 751 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 668 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 679 place count 740 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 690 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 701 place count 729 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 712 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 723 place count 729 transition count 671
Applied a total of 723 rules in 252 ms. Remains 729 /1081 variables (removed 352) and now considering 671/1103 (removed 432) transitions.
// Phase 1: matrix 671 rows 729 cols
[2023-03-11 11:26:06] [INFO ] Computed 70 place invariants in 8 ms
[2023-03-11 11:26:06] [INFO ] Implicit Places using invariants in 156 ms returned [143, 485, 629]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 157 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1081 places, 671/1103 transitions.
Applied a total of 0 rules in 12 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 422 ms. Remains : 726/1081 places, 671/1103 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s95 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][false, false, false]]
Product exploration explored 100000 steps with 185 reset in 158 ms.
Product exploration explored 100000 steps with 190 reset in 165 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 515 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=171 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:26:07] [INFO ] Computed 67 place invariants in 6 ms
[2023-03-11 11:26:07] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:08] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-11 11:26:08] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 33 ms.
[2023-03-11 11:26:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:26:11] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:11] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-11 11:26:11] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 39 ms.
[2023-03-11 11:26:16] [INFO ] Added : 640 causal constraints over 128 iterations in 5532 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 16 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2023-03-11 11:26:17] [INFO ] Invariant cache hit.
[2023-03-11 11:26:17] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 11:26:17] [INFO ] Invariant cache hit.
[2023-03-11 11:26:17] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-11 11:26:17] [INFO ] Invariant cache hit.
[2023-03-11 11:26:17] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 726/726 places, 671/671 transitions.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 627 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 11:26:18] [INFO ] Invariant cache hit.
[2023-03-11 11:26:18] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:19] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-11 11:26:19] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 38 ms.
[2023-03-11 11:26:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:26:21] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:22] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-11 11:26:22] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 28 ms.
[2023-03-11 11:26:27] [INFO ] Added : 620 causal constraints over 124 iterations in 5471 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 190 reset in 155 ms.
Product exploration explored 100000 steps with 191 reset in 163 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Graph (complete) has 814 edges and 726 vertex of which 58 are kept as prefixes of interest. Removing 668 places using SCC suffix rule.6 ms
Discarding 668 places :
Also discarding 617 output transitions
Drop transitions removed 617 transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 58 transition count 54
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 21 place count 58 transition count 57
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 44 place count 58 transition count 57
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 77 place count 25 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 110 place count 25 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 25 transition count 24
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 24 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 24 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 23 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 23 transition count 23
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 118 rules in 19 ms. Remains 23 /726 variables (removed 703) and now considering 23/671 (removed 648) transitions.
[2023-03-11 11:26:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2023-03-11 11:26:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 11:26:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/726 places, 23/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 23/726 places, 23/671 transitions.
Support contains 1 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:26:28] [INFO ] Computed 67 place invariants in 3 ms
[2023-03-11 11:26:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 11:26:28] [INFO ] Invariant cache hit.
[2023-03-11 11:26:28] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-11 11:26:28] [INFO ] Invariant cache hit.
[2023-03-11 11:26:29] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 726/726 places, 671/671 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 23024 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&&X(X(p1)))) U (p2&&G((p0&&X(X(p1))))))))'
Support contains 3 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 69 place count 1012 transition count 1025
Iterating global reduction 1 with 67 rules applied. Total rules applied 136 place count 1012 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 147 place count 1012 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 172 place count 987 transition count 959
Iterating global reduction 2 with 25 rules applied. Total rules applied 197 place count 987 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 976 transition count 959
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 262 place count 922 transition count 905
Iterating global reduction 3 with 54 rules applied. Total rules applied 316 place count 922 transition count 905
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 327 place count 922 transition count 894
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 360 place count 889 transition count 841
Iterating global reduction 4 with 33 rules applied. Total rules applied 393 place count 889 transition count 841
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 414 place count 868 transition count 820
Iterating global reduction 4 with 21 rules applied. Total rules applied 435 place count 868 transition count 820
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 456 place count 847 transition count 799
Iterating global reduction 4 with 21 rules applied. Total rules applied 477 place count 847 transition count 799
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 498 place count 826 transition count 778
Iterating global reduction 4 with 21 rules applied. Total rules applied 519 place count 826 transition count 778
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 540 place count 805 transition count 757
Iterating global reduction 4 with 21 rules applied. Total rules applied 561 place count 805 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 804 transition count 757
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 583 place count 783 transition count 736
Iterating global reduction 5 with 21 rules applied. Total rules applied 604 place count 783 transition count 736
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 625 place count 762 transition count 715
Iterating global reduction 5 with 21 rules applied. Total rules applied 646 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 657 place count 751 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 668 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 679 place count 740 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 690 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 701 place count 729 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 712 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 723 place count 729 transition count 671
Applied a total of 723 rules in 233 ms. Remains 729 /1081 variables (removed 352) and now considering 671/1103 (removed 432) transitions.
// Phase 1: matrix 671 rows 729 cols
[2023-03-11 11:26:29] [INFO ] Computed 70 place invariants in 10 ms
[2023-03-11 11:26:29] [INFO ] Implicit Places using invariants in 156 ms returned [143, 485, 629]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 158 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1081 places, 671/1103 transitions.
Applied a total of 0 rules in 12 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 403 ms. Remains : 726/1081 places, 671/1103 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(GEQ s151 1), p0:(LT s646 1), p1:(LT s494 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19965 reset in 240 ms.
Product exploration explored 100000 steps with 19943 reset in 244 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X p0), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1665 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 646 steps, including 0 resets, run visited all 4 properties in 30 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X p0), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p0))), (F (AND p2 p0)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 2060 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:26:34] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-11 11:26:35] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:35] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-11 11:26:35] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 29 ms.
[2023-03-11 11:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:26:38] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 17 ms returned sat
[2023-03-11 11:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:38] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-11 11:26:38] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 29 ms.
[2023-03-11 11:26:43] [INFO ] Added : 628 causal constraints over 126 iterations in 5312 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 21 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2023-03-11 11:26:44] [INFO ] Invariant cache hit.
[2023-03-11 11:26:44] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-11 11:26:44] [INFO ] Invariant cache hit.
[2023-03-11 11:26:44] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-11 11:26:44] [INFO ] Invariant cache hit.
[2023-03-11 11:26:44] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 726/726 places, 671/671 transitions.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X p0), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1346 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 479 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X p0), true, (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p0))), (F (AND p2 p0)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 3056 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-11 11:26:49] [INFO ] Invariant cache hit.
[2023-03-11 11:26:50] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:50] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-11 11:26:50] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 30 ms.
[2023-03-11 11:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:26:53] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 16 ms returned sat
[2023-03-11 11:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:26:53] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-11 11:26:53] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 28 ms.
[2023-03-11 11:26:59] [INFO ] Added : 628 causal constraints over 126 iterations in 5677 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 1019 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 19970 reset in 241 ms.
Product exploration explored 100000 steps with 19982 reset in 248 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Graph (complete) has 814 edges and 726 vertex of which 92 are kept as prefixes of interest. Removing 634 places using SCC suffix rule.3 ms
Discarding 634 places :
Also discarding 582 output transitions
Drop transitions removed 582 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 92 transition count 88
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 38 place count 92 transition count 91
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 92 transition count 91
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 133 place count 34 transition count 33
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 191 place count 34 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 194 place count 34 transition count 33
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 196 place count 32 transition count 31
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 198 place count 32 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 199 place count 32 transition count 33
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 200 place count 31 transition count 31
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 201 place count 31 transition count 31
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 201 rules in 13 ms. Remains 31 /726 variables (removed 695) and now considering 31/671 (removed 640) transitions.
[2023-03-11 11:27:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2023-03-11 11:27:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 11:27:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/726 places, 31/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 31/726 places, 31/671 transitions.
Support contains 3 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 13 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 11:27:01] [INFO ] Computed 67 place invariants in 4 ms
[2023-03-11 11:27:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 11:27:01] [INFO ] Invariant cache hit.
[2023-03-11 11:27:01] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-11 11:27:01] [INFO ] Invariant cache hit.
[2023-03-11 11:27:02] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 726/726 places, 671/671 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 finished in 32886 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 (G(p0)||(X(p1) U ((!p2&&X(p1))||X(G(p1))))))))'
Support contains 4 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 68 place count 1013 transition count 1026
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 1013 transition count 1026
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 145 place count 1013 transition count 1015
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 169 place count 989 transition count 971
Iterating global reduction 2 with 24 rules applied. Total rules applied 193 place count 989 transition count 971
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 204 place count 978 transition count 971
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 247 place count 935 transition count 928
Iterating global reduction 3 with 43 rules applied. Total rules applied 290 place count 935 transition count 928
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 323 place count 902 transition count 875
Iterating global reduction 3 with 33 rules applied. Total rules applied 356 place count 902 transition count 875
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 377 place count 881 transition count 854
Iterating global reduction 3 with 21 rules applied. Total rules applied 398 place count 881 transition count 854
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 419 place count 860 transition count 833
Iterating global reduction 3 with 21 rules applied. Total rules applied 440 place count 860 transition count 833
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 461 place count 839 transition count 812
Iterating global reduction 3 with 21 rules applied. Total rules applied 482 place count 839 transition count 812
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 503 place count 818 transition count 791
Iterating global reduction 3 with 21 rules applied. Total rules applied 524 place count 818 transition count 791
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 817 transition count 791
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 546 place count 796 transition count 770
Iterating global reduction 4 with 21 rules applied. Total rules applied 567 place count 796 transition count 770
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 588 place count 775 transition count 749
Iterating global reduction 4 with 21 rules applied. Total rules applied 609 place count 775 transition count 749
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 620 place count 764 transition count 738
Iterating global reduction 4 with 11 rules applied. Total rules applied 631 place count 764 transition count 738
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 642 place count 753 transition count 727
Iterating global reduction 4 with 11 rules applied. Total rules applied 653 place count 753 transition count 727
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 664 place count 742 transition count 716
Iterating global reduction 4 with 11 rules applied. Total rules applied 675 place count 742 transition count 716
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 686 place count 742 transition count 705
Applied a total of 686 rules in 243 ms. Remains 742 /1081 variables (removed 339) and now considering 705/1103 (removed 398) transitions.
// Phase 1: matrix 705 rows 742 cols
[2023-03-11 11:27:02] [INFO ] Computed 70 place invariants in 8 ms
[2023-03-11 11:27:02] [INFO ] Implicit Places using invariants in 162 ms returned [498, 642]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 740/1081 places, 705/1103 transitions.
Applied a total of 0 rules in 13 ms. Remains 740 /740 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 419 ms. Remains : 740/1081 places, 705/1103 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (GEQ s689 1) (AND (GEQ s222 1) (GEQ s256 1))), p2:(AND (GEQ s60 1) (GEQ s222 1) (GEQ s256 1)), p0:(LT s689 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 215 reset in 188 ms.
Product exploration explored 100000 steps with 218 reset in 196 ms.
Computed a total of 740 stabilizing places and 705 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 740 transition count 705
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 p1) (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 2963 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 705 rows 740 cols
[2023-03-11 11:27:06] [INFO ] Computed 68 place invariants in 4 ms
[2023-03-11 11:27:06] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 24 ms returned sat
[2023-03-11 11:27:07] [INFO ] After 267ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:1
[2023-03-11 11:27:07] [INFO ] After 367ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 11:27:07] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :2 real:1
[2023-03-11 11:27:07] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 25 ms returned sat
[2023-03-11 11:27:07] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-11 11:27:08] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-11 11:27:08] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 503 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=167 )
Parikh walk visited 3 properties in 16 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0)), (G (NOT (AND (NOT p1) p0 p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND p1 p2)), (F (AND p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) p0)
Knowledge based reduction with 22 factoid took 935 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 finished in 6950 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((X(p0)||(p1&&G(p2))))&&X(!p0))))'
Support contains 6 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 1014 transition count 1025
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 1014 transition count 1025
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 145 place count 1014 transition count 1014
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 170 place count 989 transition count 959
Iterating global reduction 1 with 25 rules applied. Total rules applied 195 place count 989 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 206 place count 978 transition count 959
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 259 place count 925 transition count 906
Iterating global reduction 2 with 53 rules applied. Total rules applied 312 place count 925 transition count 906
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 323 place count 925 transition count 895
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 355 place count 893 transition count 853
Iterating global reduction 3 with 32 rules applied. Total rules applied 387 place count 893 transition count 853
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 408 place count 872 transition count 832
Iterating global reduction 3 with 21 rules applied. Total rules applied 429 place count 872 transition count 832
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 448 place count 853 transition count 813
Iterating global reduction 3 with 19 rules applied. Total rules applied 467 place count 853 transition count 813
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 486 place count 834 transition count 794
Iterating global reduction 3 with 19 rules applied. Total rules applied 505 place count 834 transition count 794
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 524 place count 815 transition count 775
Iterating global reduction 3 with 19 rules applied. Total rules applied 543 place count 815 transition count 775
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 561 place count 797 transition count 748
Iterating global reduction 3 with 18 rules applied. Total rules applied 579 place count 797 transition count 748
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 597 place count 779 transition count 730
Iterating global reduction 3 with 18 rules applied. Total rules applied 615 place count 779 transition count 730
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 624 place count 770 transition count 721
Iterating global reduction 3 with 9 rules applied. Total rules applied 633 place count 770 transition count 721
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 642 place count 761 transition count 712
Iterating global reduction 3 with 9 rules applied. Total rules applied 651 place count 761 transition count 712
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 659 place count 753 transition count 704
Iterating global reduction 3 with 8 rules applied. Total rules applied 667 place count 753 transition count 704
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 675 place count 753 transition count 696
Applied a total of 675 rules in 240 ms. Remains 753 /1081 variables (removed 328) and now considering 696/1103 (removed 407) transitions.
// Phase 1: matrix 696 rows 753 cols
[2023-03-11 11:27:09] [INFO ] Computed 73 place invariants in 8 ms
[2023-03-11 11:27:09] [INFO ] Implicit Places using invariants in 165 ms returned [150, 316, 509, 653]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 166 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 749/1081 places, 696/1103 transitions.
Applied a total of 0 rules in 14 ms. Remains 749 /749 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 749/1081 places, 696/1103 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2) p0), p0, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s80 1) (GEQ s314 1)), p2:(AND (GEQ s233 1) (GEQ s262 1)), p0:(AND (GEQ s234 1) (GEQ s273 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 836 steps with 7 reset in 2 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 finished in 679 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&&G(p1)))&&F((p2||X((G(p1) U (p2&&G(p1)))))))))'
Support contains 3 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 1103
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 68 place count 1013 transition count 1026
Iterating global reduction 1 with 66 rules applied. Total rules applied 134 place count 1013 transition count 1026
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 144 place count 1013 transition count 1016
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 169 place count 988 transition count 961
Iterating global reduction 2 with 25 rules applied. Total rules applied 194 place count 988 transition count 961
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 205 place count 977 transition count 961
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 259 place count 923 transition count 907
Iterating global reduction 3 with 54 rules applied. Total rules applied 313 place count 923 transition count 907
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 324 place count 923 transition count 896
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 357 place count 890 transition count 843
Iterating global reduction 4 with 33 rules applied. Total rules applied 390 place count 890 transition count 843
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 411 place count 869 transition count 822
Iterating global reduction 4 with 21 rules applied. Total rules applied 432 place count 869 transition count 822
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 453 place count 848 transition count 801
Iterating global reduction 4 with 21 rules applied. Total rules applied 474 place count 848 transition count 801
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 495 place count 827 transition count 780
Iterating global reduction 4 with 21 rules applied. Total rules applied 516 place count 827 transition count 780
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 537 place count 806 transition count 759
Iterating global reduction 4 with 21 rules applied. Total rules applied 558 place count 806 transition count 759
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 559 place count 805 transition count 759
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 580 place count 784 transition count 738
Iterating global reduction 5 with 21 rules applied. Total rules applied 601 place count 784 transition count 738
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 622 place count 763 transition count 717
Iterating global reduction 5 with 21 rules applied. Total rules applied 643 place count 763 transition count 717
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 654 place count 752 transition count 706
Iterating global reduction 5 with 11 rules applied. Total rules applied 665 place count 752 transition count 706
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 676 place count 741 transition count 695
Iterating global reduction 5 with 11 rules applied. Total rules applied 687 place count 741 transition count 695
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 698 place count 730 transition count 684
Iterating global reduction 5 with 11 rules applied. Total rules applied 709 place count 730 transition count 684
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 720 place count 730 transition count 673
Applied a total of 720 rules in 253 ms. Remains 730 /1081 variables (removed 351) and now considering 673/1103 (removed 430) transitions.
// Phase 1: matrix 673 rows 730 cols
[2023-03-11 11:27:10] [INFO ] Computed 70 place invariants in 7 ms
[2023-03-11 11:27:10] [INFO ] Implicit Places using invariants in 159 ms returned [143, 486, 630]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 160 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 727/1081 places, 673/1103 transitions.
Applied a total of 0 rules in 13 ms. Remains 727 /727 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 727/1081 places, 673/1103 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s76 1), p0:(LT s490 1), p1:(GEQ s451 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 645 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Graph (complete) has 1427 edges and 1081 vertex of which 409 are kept as prefixes of interest. Removing 672 places using SCC suffix rule.4 ms
Discarding 672 places :
Also discarding 685 output transitions
Drop transitions removed 685 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 354 rules applied. Total rules applied 355 place count 396 transition count 55
Reduce places removed 352 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 374 rules applied. Total rules applied 729 place count 44 transition count 33
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 740 place count 33 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 740 place count 33 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 762 place count 22 transition count 22
Applied a total of 762 rules in 12 ms. Remains 22 /1081 variables (removed 1059) and now considering 22/1103 (removed 1081) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-11 11:27:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 11:27:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 11:27:10] [INFO ] Invariant cache hit.
[2023-03-11 11:27:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 11:27:10] [INFO ] Invariant cache hit.
[2023-03-11 11:27:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/1081 places, 22/1103 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 74 ms. Remains : 22/1081 places, 22/1103 transitions.
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s11 1) (GEQ s21 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32360 reset in 83 ms.
Product exploration explored 100000 steps with 32338 reset in 93 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 11:27:11] [INFO ] Invariant cache hit.
[2023-03-11 11:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:27:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 11:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:27:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 11:27:11] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 11:27:11] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:11] [INFO ] Invariant cache hit.
[2023-03-11 11:27:11] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-11 11:27:11] [INFO ] Invariant cache hit.
[2023-03-11 11:27:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-11 11:27:11] [INFO ] Invariant cache hit.
[2023-03-11 11:27:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 546 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 11:27:12] [INFO ] Invariant cache hit.
[2023-03-11 11:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:27:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 11:27:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:27:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 11:27:12] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 11:27:12] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 2231 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32365 reset in 81 ms.
Product exploration explored 100000 steps with 32331 reset in 89 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 11:27:15] [INFO ] Invariant cache hit.
[2023-03-11 11:27:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 22/22 places, 22/22 transitions.
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:15] [INFO ] Invariant cache hit.
[2023-03-11 11:27:15] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-11 11:27:15] [INFO ] Invariant cache hit.
[2023-03-11 11:27:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-11 11:27:15] [INFO ] Invariant cache hit.
[2023-03-11 11:27:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 finished in 5101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1081 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1081/1081 places, 1103/1103 transitions.
Graph (complete) has 1427 edges and 1081 vertex of which 702 are kept as prefixes of interest. Removing 379 places using SCC suffix rule.4 ms
Discarding 379 places :
Also discarding 387 output transitions
Drop transitions removed 387 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 508 rules applied. Total rules applied 509 place count 689 transition count 199
Reduce places removed 505 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 560 rules applied. Total rules applied 1069 place count 184 transition count 144
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1102 place count 151 transition count 144
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 1102 place count 151 transition count 75
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 1265 place count 57 transition count 75
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1287 place count 57 transition count 53
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1309 place count 35 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1309 place count 35 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1311 place count 34 transition count 52
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1322 place count 23 transition count 32
Iterating global reduction 5 with 11 rules applied. Total rules applied 1333 place count 23 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1333 place count 23 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1335 place count 22 transition count 31
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1344 place count 13 transition count 13
Iterating global reduction 5 with 9 rules applied. Total rules applied 1353 place count 13 transition count 13
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 1359 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1360 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1360 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1362 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1364 place count 8 transition count 7
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1365 place count 7 transition count 6
Iterating global reduction 7 with 1 rules applied. Total rules applied 1366 place count 7 transition count 6
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1368 place count 5 transition count 4
Applied a total of 1368 rules in 20 ms. Remains 5 /1081 variables (removed 1076) and now considering 4/1103 (removed 1099) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-11 11:27:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 11:27:15] [INFO ] Implicit Places using invariants in 16 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/1081 places, 4/1103 transitions.
Graph (complete) has 2 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 11:27:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 11:27:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 11:27:15] [INFO ] Invariant cache hit.
[2023-03-11 11:27:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/1081 places, 2/1103 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 80 ms. Remains : 2/1081 places, 2/1103 transitions.
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 255 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + 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' '!(X((G((p0&&X(X(p1)))) U (p2&&G((p0&&X(X(p1))))))))'
[2023-03-11 11:27:15] [INFO ] Flatten gal took : 37 ms
[2023-03-11 11:27:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 11:27:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1081 places, 1103 transitions and 2553 arcs took 6 ms.
Total runtime 114752 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2406/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2406/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2406/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2406/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
Could not compute solution for formula : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
Could not compute solution for formula : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
Could not compute solution for formula : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11

BK_STOP 1678534050408

--------------------
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
mcc2023
ltl formula name FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
ltl formula formula --ltl=/tmp/2406/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1081 places, 1103 transitions and 2553 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.040 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2406/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2406/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2406/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2406/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563af8c2b3f4]
1: pnml2lts-mc(+0xa2496) [0x563af8c2b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff06de13140]
3: pnml2lts-mc(+0x405be5) [0x563af8f8ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x563af8cf43f9]
5: pnml2lts-mc(+0x164ac4) [0x563af8cedac4]
6: pnml2lts-mc(+0x272e0a) [0x563af8dfbe0a]
7: pnml2lts-mc(+0xb61f0) [0x563af8c3f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff06dc664d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff06dc6667a]
10: pnml2lts-mc(+0xa1581) [0x563af8c2a581]
11: pnml2lts-mc(+0xa1910) [0x563af8c2a910]
12: pnml2lts-mc(+0xa32a2) [0x563af8c2c2a2]
13: pnml2lts-mc(+0xa50f4) [0x563af8c2e0f4]
14: pnml2lts-mc(+0xa516b) [0x563af8c2e16b]
15: pnml2lts-mc(+0x3f34b3) [0x563af8f7c4b3]
16: pnml2lts-mc(+0x7c63d) [0x563af8c0563d]
17: pnml2lts-mc(+0x67d86) [0x563af8bf0d86]
18: pnml2lts-mc(+0x60a8a) [0x563af8be9a8a]
19: pnml2lts-mc(+0x5eb15) [0x563af8be7b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff06dc4ed0a]
21: pnml2lts-mc(+0x6075e) [0x563af8be975e]
ltl formula name FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
ltl formula formula --ltl=/tmp/2406/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1081 places, 1103 transitions and 2553 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2406/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2406/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2406/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2406/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
ltl formula formula --ltl=/tmp/2406/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1081 places, 1103 transitions and 2553 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2406/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2406/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2406/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2406/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
ltl formula formula --ltl=/tmp/2406/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1081 places, 1103 transitions and 2553 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2406/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2406/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2406/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2406/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="FamilyReunion-PT-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, 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 r169-tall-167838855800396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;