Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r492-smll-171636267000483.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636267000483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 20K Apr 11 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 11 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 11 20:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 20:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 11 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 552K May 18 16:42 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-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717275519136

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:58:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:58:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:58:41] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-01 20:58:41] [INFO ] Transformed 1475 places.
[2024-06-01 20:58:41] [INFO ] Transformed 1234 transitions.
[2024-06-01 20:58:42] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 363 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 21 places and 0 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 1356 transition count 1234
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 174 place count 1291 transition count 1169
Iterating global reduction 1 with 65 rules applied. Total rules applied 239 place count 1291 transition count 1169
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 249 place count 1281 transition count 1169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 260 place count 1270 transition count 1158
Iterating global reduction 2 with 11 rules applied. Total rules applied 271 place count 1270 transition count 1158
Applied a total of 271 rules in 555 ms. Remains 1270 /1465 variables (removed 195) and now considering 1158/1234 (removed 76) transitions.
// Phase 1: matrix 1158 rows 1270 cols
[2024-06-01 20:58:43] [INFO ] Computed 216 invariants in 82 ms
[2024-06-01 20:58:44] [INFO ] Implicit Places using invariants in 1212 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 768, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 969, 970, 971, 973, 974, 975, 976, 977, 978, 979, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180]
Discarding 76 places :
Implicit Place search using SMT only with invariants took 1275 ms to find 76 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1194/1465 places, 1158/1234 transitions.
Applied a total of 0 rules in 47 ms. Remains 1194 /1194 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1914 ms. Remains : 1194/1465 places, 1158/1234 transitions.
Support contains 363 out of 1194 places after structural reductions.
[2024-06-01 20:58:45] [INFO ] Flatten gal took : 244 ms
[2024-06-01 20:58:45] [INFO ] Flatten gal took : 136 ms
[2024-06-01 20:58:45] [INFO ] Input system was already deterministic with 1158 transitions.
RANDOM walk for 40000 steps (60 resets) in 2618 ms. (15 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
// Phase 1: matrix 1158 rows 1194 cols
[2024-06-01 20:58:46] [INFO ] Computed 140 invariants in 19 ms
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 876/936 variables, 33/33 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 936/2352 variables, and 54 constraints, problems are : Problem set: 4 solved, 0 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 33/34 constraints, Generalized P Invariants (flows): 21/106 constraints, State Equation: 0/1194 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1194 stabilizing places and 1158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1194 transition count 1158
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||((G(!p0)||(!p0&&F(p1)))&&X(p2)))))'
Support contains 57 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 1137 transition count 1158
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 124 place count 1070 transition count 1080
Iterating global reduction 1 with 67 rules applied. Total rules applied 191 place count 1070 transition count 1080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 201 place count 1070 transition count 1070
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 1056 transition count 1036
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 1056 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 231 place count 1055 transition count 1035
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 254 place count 1032 transition count 1002
Iterating global reduction 3 with 23 rules applied. Total rules applied 277 place count 1032 transition count 1002
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 300 place count 1009 transition count 969
Iterating global reduction 3 with 23 rules applied. Total rules applied 323 place count 1009 transition count 969
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 334 place count 998 transition count 969
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 345 place count 987 transition count 958
Iterating global reduction 4 with 11 rules applied. Total rules applied 356 place count 987 transition count 958
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 367 place count 976 transition count 947
Iterating global reduction 4 with 11 rules applied. Total rules applied 378 place count 976 transition count 947
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 389 place count 965 transition count 936
Iterating global reduction 4 with 11 rules applied. Total rules applied 400 place count 965 transition count 936
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 411 place count 954 transition count 925
Iterating global reduction 4 with 11 rules applied. Total rules applied 422 place count 954 transition count 925
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 433 place count 943 transition count 914
Iterating global reduction 4 with 11 rules applied. Total rules applied 444 place count 943 transition count 914
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 455 place count 932 transition count 903
Iterating global reduction 4 with 11 rules applied. Total rules applied 466 place count 932 transition count 903
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 477 place count 921 transition count 892
Iterating global reduction 4 with 11 rules applied. Total rules applied 488 place count 921 transition count 892
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 499 place count 910 transition count 881
Iterating global reduction 4 with 11 rules applied. Total rules applied 510 place count 910 transition count 881
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 521 place count 899 transition count 870
Iterating global reduction 4 with 11 rules applied. Total rules applied 532 place count 899 transition count 870
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 543 place count 888 transition count 859
Iterating global reduction 4 with 11 rules applied. Total rules applied 554 place count 888 transition count 859
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 565 place count 877 transition count 848
Iterating global reduction 4 with 11 rules applied. Total rules applied 576 place count 877 transition count 848
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 587 place count 866 transition count 837
Iterating global reduction 4 with 11 rules applied. Total rules applied 598 place count 866 transition count 837
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 609 place count 866 transition count 826
Applied a total of 609 rules in 1282 ms. Remains 866 /1194 variables (removed 328) and now considering 826/1158 (removed 332) transitions.
// Phase 1: matrix 826 rows 866 cols
[2024-06-01 20:58:48] [INFO ] Computed 83 invariants in 7 ms
[2024-06-01 20:58:49] [INFO ] Implicit Places using invariants in 385 ms returned [355, 400, 622, 766]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 390 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 862/1194 places, 826/1158 transitions.
Applied a total of 0 rules in 24 ms. Remains 862 /862 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1699 ms. Remains : 862/1194 places, 826/1158 transitions.
Stuttering acceptance computed with spot in 357 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 962 ms.
Product exploration explored 100000 steps with 50000 reset in 627 ms.
Computed a total of 862 stabilizing places and 826 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 862 transition count 826
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 229 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 finished in 4290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(p2)))))'
Support contains 79 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 1137 transition count 1158
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 114 place count 1080 transition count 1080
Iterating global reduction 1 with 57 rules applied. Total rules applied 171 place count 1080 transition count 1080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 181 place count 1080 transition count 1070
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 206 place count 1055 transition count 1025
Iterating global reduction 2 with 25 rules applied. Total rules applied 231 place count 1055 transition count 1025
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 244 place count 1054 transition count 1013
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 266 place count 1032 transition count 991
Iterating global reduction 3 with 22 rules applied. Total rules applied 288 place count 1032 transition count 991
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 300 place count 1020 transition count 969
Iterating global reduction 3 with 12 rules applied. Total rules applied 312 place count 1020 transition count 969
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 323 place count 1009 transition count 969
Applied a total of 323 rules in 221 ms. Remains 1009 /1194 variables (removed 185) and now considering 969/1158 (removed 189) transitions.
// Phase 1: matrix 969 rows 1009 cols
[2024-06-01 20:58:52] [INFO ] Computed 72 invariants in 12 ms
[2024-06-01 20:58:52] [INFO ] Implicit Places using invariants in 544 ms returned [176, 464, 764, 909]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 547 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1005/1194 places, 969/1158 transitions.
Applied a total of 0 rules in 52 ms. Remains 1005 /1005 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 824 ms. Remains : 1005/1194 places, 969/1158 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 605 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 finished in 975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 77 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1148 transition count 1158
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 93 place count 1101 transition count 1090
Iterating global reduction 1 with 47 rules applied. Total rules applied 140 place count 1101 transition count 1090
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 184 place count 1057 transition count 1036
Iterating global reduction 1 with 44 rules applied. Total rules applied 228 place count 1057 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 239 place count 1057 transition count 1025
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 261 place count 1035 transition count 993
Iterating global reduction 2 with 22 rules applied. Total rules applied 283 place count 1035 transition count 993
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 294 place count 1024 transition count 962
Iterating global reduction 2 with 11 rules applied. Total rules applied 305 place count 1024 transition count 962
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 316 place count 1013 transition count 962
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 326 place count 1003 transition count 952
Iterating global reduction 3 with 10 rules applied. Total rules applied 336 place count 1003 transition count 952
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 346 place count 993 transition count 942
Iterating global reduction 3 with 10 rules applied. Total rules applied 356 place count 993 transition count 942
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 366 place count 983 transition count 932
Iterating global reduction 3 with 10 rules applied. Total rules applied 376 place count 983 transition count 932
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 386 place count 973 transition count 922
Iterating global reduction 3 with 10 rules applied. Total rules applied 396 place count 973 transition count 922
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 397 place count 972 transition count 922
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 407 place count 962 transition count 912
Iterating global reduction 4 with 10 rules applied. Total rules applied 417 place count 962 transition count 912
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 427 place count 952 transition count 902
Iterating global reduction 4 with 10 rules applied. Total rules applied 437 place count 952 transition count 902
Applied a total of 437 rules in 599 ms. Remains 952 /1194 variables (removed 242) and now considering 902/1158 (removed 256) transitions.
// Phase 1: matrix 902 rows 952 cols
[2024-06-01 20:58:53] [INFO ] Computed 94 invariants in 7 ms
[2024-06-01 20:58:54] [INFO ] Implicit Places using invariants in 585 ms returned [176, 503, 673, 863]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 591 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 948/1194 places, 902/1158 transitions.
Applied a total of 0 rules in 32 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1223 ms. Remains : 948/1194 places, 902/1158 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02
Product exploration explored 100000 steps with 155 reset in 605 ms.
Product exploration explored 100000 steps with 155 reset in 380 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 finished in 2700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Support contains 33 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1148 transition count 1158
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 125 place count 1069 transition count 1058
Iterating global reduction 1 with 79 rules applied. Total rules applied 204 place count 1069 transition count 1058
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 214 place count 1069 transition count 1048
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 260 place count 1023 transition count 982
Iterating global reduction 2 with 46 rules applied. Total rules applied 306 place count 1023 transition count 982
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 319 place count 1022 transition count 970
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 352 place count 989 transition count 927
Iterating global reduction 3 with 33 rules applied. Total rules applied 385 place count 989 transition count 927
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 418 place count 956 transition count 874
Iterating global reduction 3 with 33 rules applied. Total rules applied 451 place count 956 transition count 874
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 462 place count 945 transition count 874
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 483 place count 924 transition count 853
Iterating global reduction 4 with 21 rules applied. Total rules applied 504 place count 924 transition count 853
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 525 place count 903 transition count 832
Iterating global reduction 4 with 21 rules applied. Total rules applied 546 place count 903 transition count 832
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 567 place count 882 transition count 811
Iterating global reduction 4 with 21 rules applied. Total rules applied 588 place count 882 transition count 811
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 609 place count 861 transition count 790
Iterating global reduction 4 with 21 rules applied. Total rules applied 630 place count 861 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 631 place count 860 transition count 790
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 641 place count 850 transition count 780
Iterating global reduction 5 with 10 rules applied. Total rules applied 651 place count 850 transition count 780
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 661 place count 840 transition count 770
Iterating global reduction 5 with 10 rules applied. Total rules applied 671 place count 840 transition count 770
Applied a total of 671 rules in 903 ms. Remains 840 /1194 variables (removed 354) and now considering 770/1158 (removed 388) transitions.
// Phase 1: matrix 770 rows 840 cols
[2024-06-01 20:58:56] [INFO ] Computed 93 invariants in 8 ms
[2024-06-01 20:58:56] [INFO ] Implicit Places using invariants in 431 ms returned [176, 437, 596, 740]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 435 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/1194 places, 770/1158 transitions.
Applied a total of 0 rules in 31 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1369 ms. Remains : 836/1194 places, 770/1158 transitions.
Stuttering acceptance computed with spot in 239 ms :[p0, true, true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
Product exploration explored 100000 steps with 277 reset in 375 ms.
Product exploration explored 100000 steps with 278 reset in 406 ms.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0]
RANDOM walk for 1350 steps (0 resets) in 21 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 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 141 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 136 ms :[p0, p0, p0]
// Phase 1: matrix 770 rows 836 cols
[2024-06-01 20:58:58] [INFO ] Computed 89 invariants in 7 ms
[2024-06-01 20:58:59] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 58 ms returned sat
[2024-06-01 20:59:01] [INFO ] [Real]Absence check using state equation in 1387 ms returned sat
[2024-06-01 20:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:59:02] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 62 ms returned sat
[2024-06-01 20:59:04] [INFO ] [Nat]Absence check using state equation in 1911 ms returned sat
[2024-06-01 20:59:04] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 72 ms.
[2024-06-01 20:59:15] [INFO ] Added : 482 causal constraints over 97 iterations in 11593 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Applied a total of 0 rules in 36 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 20:59:15] [INFO ] Invariant cache hit.
[2024-06-01 20:59:16] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-06-01 20:59:16] [INFO ] Invariant cache hit.
[2024-06-01 20:59:17] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2024-06-01 20:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/1606 variables, and 87 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30063 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/825 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (OVERLAPS) 11/836 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/1606 variables, and 89 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 89/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Finished structural reductions in LTL mode , in 1 iterations and 61995 ms. Remains : 836/836 places, 770/770 transitions.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 152 ms :[p0, p0, p0]
RANDOM walk for 1546 steps (0 resets) in 18 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 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 145 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0]
[2024-06-01 21:00:19] [INFO ] Invariant cache hit.
[2024-06-01 21:00:20] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 83 ms returned sat
[2024-06-01 21:00:21] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2024-06-01 21:00:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:00:22] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 43 ms returned sat
[2024-06-01 21:00:24] [INFO ] [Nat]Absence check using state equation in 1689 ms returned sat
[2024-06-01 21:00:24] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 60 ms.
[2024-06-01 21:00:34] [INFO ] Added : 463 causal constraints over 93 iterations in 10838 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 278 reset in 372 ms.
Product exploration explored 100000 steps with 279 reset in 407 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Graph (complete) has 957 edges and 836 vertex of which 649 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.9 ms
Discarding 187 places :
Also discarding 143 output transitions
Drop transitions (Output transitions of discarded places.) removed 143 transitions
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 649 transition count 627
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 232 place count 649 transition count 660
Deduced a syphon composed of 484 places in 1 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 485 place count 649 transition count 660
Discarding 319 places :
Symmetric choice reduction at 1 with 319 rule applications. Total rules 804 place count 330 transition count 341
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 319 rules applied. Total rules applied 1123 place count 330 transition count 341
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1134 place count 330 transition count 341
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1145 place count 319 transition count 330
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1156 place count 319 transition count 330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1167 place count 319 transition count 385
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1178 place count 308 transition count 363
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1189 place count 308 transition count 363
Deduced a syphon composed of 165 places in 1 ms
Applied a total of 1189 rules in 492 ms. Remains 308 /836 variables (removed 528) and now considering 363/770 (removed 407) transitions.
[2024-06-01 21:00:36] [INFO ] Redundant transitions in 41 ms returned []
Running 341 sub problems to find dead transitions.
// Phase 1: matrix 363 rows 308 cols
[2024-06-01 21:00:36] [INFO ] Computed 44 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 363/660 variables, 297/341 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 0/341 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 11/671 variables, 11/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/671 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 352 constraints, problems are : Problem set: 231 solved, 110 unsolved in 14244 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 231 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 66/198 variables, 44/44 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/44 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 363/561 variables, 198/242 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 110/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 110/671 variables, 110/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 0/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/671 variables, 0/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 462 constraints, problems are : Problem set: 231 solved, 110 unsolved in 9040 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 110/341 constraints, Known Traps: 0/0 constraints]
After SMT, in 23361ms problems are : Problem set: 231 solved, 110 unsolved
Search for dead transitions found 231 dead transitions in 23370ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 308/836 places, 132/770 transitions.
Graph (complete) has 297 edges and 308 vertex of which 143 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.2 ms
Discarding 165 places :
Also discarding 0 output transitions
Ensure Unique test removed 44 places
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 99 transition count 132
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 99 transition count 132
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 23 place count 88 transition count 121
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 34 place count 88 transition count 121
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 56 place count 88 transition count 99
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 56 rules in 19 ms. Remains 88 /308 variables (removed 220) and now considering 99/132 (removed 33) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/836 places, 99/770 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23933 ms. Remains : 88/836 places, 99/770 transitions.
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Applied a total of 0 rules in 44 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
// Phase 1: matrix 770 rows 836 cols
[2024-06-01 21:01:00] [INFO ] Computed 89 invariants in 6 ms
[2024-06-01 21:01:00] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 21:01:00] [INFO ] Invariant cache hit.
[2024-06-01 21:01:01] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2024-06-01 21:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/1606 variables, and 87 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/825 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (OVERLAPS) 11/836 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/1606 variables, and 89 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 89/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in LTL mode , in 1 iterations and 61723 ms. Remains : 836/836 places, 770/770 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 186839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(((X(F(p1))&&G(!p0))||G(F(p1)))))))'
Support contains 33 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 1126 transition count 1158
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 147 place count 1047 transition count 1058
Iterating global reduction 1 with 79 rules applied. Total rules applied 226 place count 1047 transition count 1058
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 236 place count 1047 transition count 1048
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 282 place count 1001 transition count 982
Iterating global reduction 2 with 46 rules applied. Total rules applied 328 place count 1001 transition count 982
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 1000 transition count 970
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 374 place count 967 transition count 927
Iterating global reduction 3 with 33 rules applied. Total rules applied 407 place count 967 transition count 927
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 440 place count 934 transition count 874
Iterating global reduction 3 with 33 rules applied. Total rules applied 473 place count 934 transition count 874
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 484 place count 923 transition count 874
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 505 place count 902 transition count 853
Iterating global reduction 4 with 21 rules applied. Total rules applied 526 place count 902 transition count 853
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 547 place count 881 transition count 832
Iterating global reduction 4 with 21 rules applied. Total rules applied 568 place count 881 transition count 832
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 589 place count 860 transition count 811
Iterating global reduction 4 with 21 rules applied. Total rules applied 610 place count 860 transition count 811
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 631 place count 839 transition count 790
Iterating global reduction 4 with 21 rules applied. Total rules applied 652 place count 839 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 653 place count 838 transition count 790
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 674 place count 817 transition count 769
Iterating global reduction 5 with 21 rules applied. Total rules applied 695 place count 817 transition count 769
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 716 place count 796 transition count 748
Iterating global reduction 5 with 21 rules applied. Total rules applied 737 place count 796 transition count 748
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 748 place count 785 transition count 737
Iterating global reduction 5 with 11 rules applied. Total rules applied 759 place count 785 transition count 737
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 770 place count 774 transition count 726
Iterating global reduction 5 with 11 rules applied. Total rules applied 781 place count 774 transition count 726
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 792 place count 763 transition count 715
Iterating global reduction 5 with 11 rules applied. Total rules applied 803 place count 763 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 814 place count 752 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 825 place count 752 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 836 place count 741 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 847 place count 741 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 858 place count 730 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 869 place count 730 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 880 place count 730 transition count 671
Applied a total of 880 rules in 769 ms. Remains 730 /1194 variables (removed 464) and now considering 671/1158 (removed 487) transitions.
// Phase 1: matrix 671 rows 730 cols
[2024-06-01 21:02:03] [INFO ] Computed 71 invariants in 4 ms
[2024-06-01 21:02:03] [INFO ] Implicit Places using invariants in 328 ms returned [143, 327, 486, 630]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 329 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1194 places, 671/1158 transitions.
Applied a total of 0 rules in 25 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 1124 ms. Remains : 726/1194 places, 671/1158 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05
Product exploration explored 100000 steps with 337 reset in 350 ms.
Product exploration explored 100000 steps with 332 reset in 555 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 p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 finished in 2520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p1 U p2))))'
Support contains 66 out of 1194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 1068 are kept as prefixes of interest. Removing 126 places using SCC suffix rule.6 ms
Discarding 126 places :
Also discarding 133 output transitions
Drop transitions (Output transitions of discarded places.) removed 133 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 527 rules applied. Total rules applied 528 place count 1013 transition count 531
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 515 rules applied. Total rules applied 1043 place count 530 transition count 499
Reduce places removed 21 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 76 rules applied. Total rules applied 1119 place count 509 transition count 444
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1174 place count 454 transition count 444
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 131 Pre rules applied. Total rules applied 1174 place count 454 transition count 313
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 4 with 306 rules applied. Total rules applied 1480 place count 279 transition count 313
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 11 rules applied. Total rules applied 1491 place count 268 transition count 313
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1491 place count 268 transition count 302
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1513 place count 257 transition count 302
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1529 place count 241 transition count 256
Iterating global reduction 5 with 16 rules applied. Total rules applied 1545 place count 241 transition count 256
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 33 rules applied. Total rules applied 1578 place count 241 transition count 223
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1589 place count 230 transition count 223
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1589 place count 230 transition count 221
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1593 place count 228 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1594 place count 227 transition count 210
Iterating global reduction 7 with 1 rules applied. Total rules applied 1595 place count 227 transition count 210
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1596 place count 226 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1596 place count 226 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1598 place count 225 transition count 209
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1642 place count 203 transition count 187
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1653 place count 192 transition count 176
Applied a total of 1653 rules in 96 ms. Remains 192 /1194 variables (removed 1002) and now considering 176/1158 (removed 982) transitions.
// Phase 1: matrix 176 rows 192 cols
[2024-06-01 21:02:04] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 21:02:05] [INFO ] Implicit Places using invariants in 109 ms returned [11, 90, 124, 169]
[2024-06-01 21:02:05] [INFO ] Actually due to overlaps returned [11, 90, 169]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/1194 places, 176/1158 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 189 transition count 154
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 167 transition count 154
Applied a total of 44 rules in 8 ms. Remains 167 /189 variables (removed 22) and now considering 154/176 (removed 22) transitions.
// Phase 1: matrix 154 rows 167 cols
[2024-06-01 21:02:05] [INFO ] Computed 24 invariants in 0 ms
[2024-06-01 21:02:05] [INFO ] Implicit Places using invariants in 79 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 111]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 80 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/1194 places, 154/1158 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 300 ms. Remains : 155/1194 places, 154/1158 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06
Product exploration explored 100000 steps with 1588 reset in 589 ms.
Product exploration explored 100000 steps with 1585 reset in 381 ms.
Computed a total of 155 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 154
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 p2 p1 p0), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 370 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 finished in 1983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 1107 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.4 ms
Discarding 87 places :
Also discarding 74 output transitions
Drop transitions (Output transitions of discarded places.) removed 74 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 603 transitions
Trivial Post-agglo rules discarded 603 transitions
Performed 603 trivial Post agglomeration. Transition count delta: 603
Iterating post reduction 0 with 657 rules applied. Total rules applied 658 place count 1052 transition count 460
Reduce places removed 603 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 636 rules applied. Total rules applied 1294 place count 449 transition count 427
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1316 place count 427 transition count 427
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 1316 place count 427 transition count 276
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1672 place count 222 transition count 276
Drop transitions (Trivial Post-Agglo cleanup.) 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 1694 place count 222 transition count 254
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1716 place count 200 transition count 254
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1716 place count 200 transition count 244
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1736 place count 190 transition count 244
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1760 place count 166 transition count 200
Iterating global reduction 5 with 24 rules applied. Total rules applied 1784 place count 166 transition count 200
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 25 rules applied. Total rules applied 1809 place count 165 transition count 176
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 1812 place count 163 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1813 place count 162 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1813 place count 162 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1837 place count 150 transition count 163
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1838 place count 149 transition count 152
Iterating global reduction 8 with 1 rules applied. Total rules applied 1839 place count 149 transition count 152
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 8 with 32 rules applied. Total rules applied 1871 place count 148 transition count 121
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1891 place count 128 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1891 place count 128 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1893 place count 127 transition count 120
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 10 with 49 rules applied. Total rules applied 1942 place count 102 transition count 96
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 1953 place count 91 transition count 85
Applied a total of 1953 rules in 67 ms. Remains 91 /1194 variables (removed 1103) and now considering 85/1158 (removed 1073) transitions.
// Phase 1: matrix 85 rows 91 cols
[2024-06-01 21:02:06] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 161 ms returned [0, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 71, 77]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 163 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/1194 places, 85/1158 transitions.
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 55 transition count 64
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 45 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 44 transition count 63
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 22 place count 44 transition count 52
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 44 place count 33 transition count 52
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 53 place count 24 transition count 34
Iterating global reduction 3 with 9 rules applied. Total rules applied 62 place count 24 transition count 34
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 70 place count 16 transition count 18
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 16 transition count 18
Applied a total of 78 rules in 9 ms. Remains 16 /66 variables (removed 50) and now considering 18/85 (removed 67) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-06-01 21:02:07] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 21:02:07] [INFO ] Invariant cache hit.
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/1194 places, 18/1158 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 318 ms. Remains : 15/1194 places, 18/1158 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09
Product exploration explored 100000 steps with 11417 reset in 107 ms.
Product exploration explored 100000 steps with 11459 reset in 125 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 1029 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.3 ms
Discarding 165 places :
Also discarding 162 output transitions
Drop transitions (Output transitions of discarded places.) removed 162 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 568 transitions
Trivial Post-agglo rules discarded 568 transitions
Performed 568 trivial Post agglomeration. Transition count delta: 568
Iterating post reduction 0 with 612 rules applied. Total rules applied 613 place count 974 transition count 417
Reduce places removed 568 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 601 rules applied. Total rules applied 1214 place count 406 transition count 384
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 1238 place count 384 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1240 place count 382 transition count 382
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 150 Pre rules applied. Total rules applied 1240 place count 382 transition count 232
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 1594 place count 178 transition count 232
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 22 rules applied. Total rules applied 1616 place count 177 transition count 211
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1637 place count 156 transition count 211
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1637 place count 156 transition count 200
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1659 place count 145 transition count 200
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1675 place count 129 transition count 154
Iterating global reduction 6 with 16 rules applied. Total rules applied 1691 place count 129 transition count 154
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 24 rules applied. Total rules applied 1715 place count 128 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1717 place count 126 transition count 131
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1717 place count 126 transition count 118
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1743 place count 113 transition count 118
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1744 place count 112 transition count 107
Iterating global reduction 8 with 1 rules applied. Total rules applied 1745 place count 112 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 8 with 31 rules applied. Total rules applied 1776 place count 111 transition count 77
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1796 place count 91 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1796 place count 91 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1798 place count 90 transition count 76
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 27 rules applied. Total rules applied 1825 place count 76 transition count 63
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1835 place count 66 transition count 53
Applied a total of 1835 rules in 55 ms. Remains 66 /1194 variables (removed 1128) and now considering 53/1158 (removed 1105) transitions.
// Phase 1: matrix 53 rows 66 cols
[2024-06-01 21:02:07] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 107 ms returned [1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 51, 54]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 110 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/1194 places, 53/1158 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 32
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 31 transition count 32
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 24 place count 31 transition count 21
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 46 place count 20 transition count 21
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 11 transition count 12
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 11 transition count 12
Applied a total of 64 rules in 4 ms. Remains 11 /52 variables (removed 41) and now considering 12/53 (removed 41) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-06-01 21:02:07] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 21:02:07] [INFO ] Invariant cache hit.
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1194 places, 12/1158 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 236 ms. Remains : 10/1194 places, 12/1158 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 426 are kept as prefixes of interest. Removing 768 places using SCC suffix rule.2 ms
Discarding 768 places :
Also discarding 754 output transitions
Drop transitions (Output transitions of discarded places.) removed 754 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 348 rules applied. Total rules applied 349 place count 371 transition count 89
Reduce places removed 304 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 307 rules applied. Total rules applied 656 place count 67 transition count 86
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 659 place count 65 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 660 place count 64 transition count 85
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 660 place count 64 transition count 72
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 686 place count 51 transition count 72
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 706 place count 31 transition count 42
Iterating global reduction 4 with 20 rules applied. Total rules applied 726 place count 31 transition count 42
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 736 place count 31 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 736 place count 31 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 740 place count 29 transition count 30
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 748 place count 21 transition count 22
Iterating global reduction 5 with 8 rules applied. Total rules applied 756 place count 21 transition count 22
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 763 place count 14 transition count 15
Iterating global reduction 5 with 7 rules applied. Total rules applied 770 place count 14 transition count 15
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 5 with 2 rules applied. Total rules applied 772 place count 13 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 775 place count 10 transition count 11
Applied a total of 775 rules in 20 ms. Remains 10 /1194 variables (removed 1184) and now considering 11/1158 (removed 1147) transitions.
// Phase 1: matrix 11 rows 10 cols
[2024-06-01 21:02:07] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 28 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/1194 places, 11/1158 transitions.
Graph (complete) has 7 edges and 9 vertex of which 8 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 (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-06-01 21:02:07] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 21:02:07] [INFO ] Invariant cache hit.
[2024-06-01 21:02:07] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/1194 places, 10/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 8/1194 places, 10/1158 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11
Product exploration explored 100000 steps with 14701 reset in 121 ms.
Product exploration explored 100000 steps with 14737 reset in 108 ms.
Computed a total of 8 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 6 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 1127 transition count 1158
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 134 place count 1060 transition count 1070
Iterating global reduction 1 with 67 rules applied. Total rules applied 201 place count 1060 transition count 1070
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 211 place count 1060 transition count 1060
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 245 place count 1026 transition count 1006
Iterating global reduction 2 with 34 rules applied. Total rules applied 279 place count 1026 transition count 1006
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 291 place count 1025 transition count 995
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 323 place count 993 transition count 963
Iterating global reduction 3 with 32 rules applied. Total rules applied 355 place count 993 transition count 963
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 377 place count 971 transition count 921
Iterating global reduction 3 with 22 rules applied. Total rules applied 399 place count 971 transition count 921
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 410 place count 960 transition count 921
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 420 place count 950 transition count 911
Iterating global reduction 4 with 10 rules applied. Total rules applied 430 place count 950 transition count 911
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 440 place count 940 transition count 901
Iterating global reduction 4 with 10 rules applied. Total rules applied 450 place count 940 transition count 901
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 460 place count 930 transition count 891
Iterating global reduction 4 with 10 rules applied. Total rules applied 470 place count 930 transition count 891
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 480 place count 920 transition count 881
Iterating global reduction 4 with 10 rules applied. Total rules applied 490 place count 920 transition count 881
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 491 place count 919 transition count 881
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 501 place count 909 transition count 871
Iterating global reduction 5 with 10 rules applied. Total rules applied 511 place count 909 transition count 871
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 521 place count 899 transition count 861
Iterating global reduction 5 with 10 rules applied. Total rules applied 531 place count 899 transition count 861
Applied a total of 531 rules in 599 ms. Remains 899 /1194 variables (removed 295) and now considering 861/1158 (removed 297) transitions.
// Phase 1: matrix 861 rows 899 cols
[2024-06-01 21:02:08] [INFO ] Computed 71 invariants in 8 ms
[2024-06-01 21:02:09] [INFO ] Implicit Places using invariants in 429 ms returned [176, 655, 799]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 432 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 896/1194 places, 861/1158 transitions.
Applied a total of 0 rules in 56 ms. Remains 896 /896 variables (removed 0) and now considering 861/861 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1088 ms. Remains : 896/1194 places, 861/1158 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Product exploration explored 100000 steps with 33333 reset in 410 ms.
Computed a total of 896 stabilizing places and 861 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 896 transition count 861
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 p2 p1 p0), (X p0), (X (X p1)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 finished in 2404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(G(!p1))) U (p0&&X(X(G(!p1)))))))))'
Support contains 4 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 1127 transition count 1158
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 145 place count 1049 transition count 1059
Iterating global reduction 1 with 78 rules applied. Total rules applied 223 place count 1049 transition count 1059
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 233 place count 1049 transition count 1049
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 277 place count 1005 transition count 985
Iterating global reduction 2 with 44 rules applied. Total rules applied 321 place count 1005 transition count 985
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 334 place count 1004 transition count 973
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 366 place count 972 transition count 931
Iterating global reduction 3 with 32 rules applied. Total rules applied 398 place count 972 transition count 931
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 430 place count 940 transition count 880
Iterating global reduction 3 with 32 rules applied. Total rules applied 462 place count 940 transition count 880
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 473 place count 929 transition count 880
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 493 place count 909 transition count 860
Iterating global reduction 4 with 20 rules applied. Total rules applied 513 place count 909 transition count 860
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 533 place count 889 transition count 840
Iterating global reduction 4 with 20 rules applied. Total rules applied 553 place count 889 transition count 840
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 573 place count 869 transition count 820
Iterating global reduction 4 with 20 rules applied. Total rules applied 593 place count 869 transition count 820
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 613 place count 849 transition count 800
Iterating global reduction 4 with 20 rules applied. Total rules applied 633 place count 849 transition count 800
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 652 place count 830 transition count 781
Iterating global reduction 4 with 19 rules applied. Total rules applied 671 place count 830 transition count 781
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 690 place count 811 transition count 762
Iterating global reduction 4 with 19 rules applied. Total rules applied 709 place count 811 transition count 762
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 720 place count 800 transition count 751
Iterating global reduction 4 with 11 rules applied. Total rules applied 731 place count 800 transition count 751
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 742 place count 789 transition count 740
Iterating global reduction 4 with 11 rules applied. Total rules applied 753 place count 789 transition count 740
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 763 place count 779 transition count 730
Iterating global reduction 4 with 10 rules applied. Total rules applied 773 place count 779 transition count 730
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 783 place count 769 transition count 720
Iterating global reduction 4 with 10 rules applied. Total rules applied 793 place count 769 transition count 720
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 803 place count 759 transition count 710
Iterating global reduction 4 with 10 rules applied. Total rules applied 813 place count 759 transition count 710
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 823 place count 749 transition count 700
Iterating global reduction 4 with 10 rules applied. Total rules applied 833 place count 749 transition count 700
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 843 place count 749 transition count 690
Applied a total of 843 rules in 891 ms. Remains 749 /1194 variables (removed 445) and now considering 690/1158 (removed 468) transitions.
// Phase 1: matrix 690 rows 749 cols
[2024-06-01 21:02:11] [INFO ] Computed 73 invariants in 4 ms
[2024-06-01 21:02:12] [INFO ] Implicit Places using invariants in 388 ms returned [146, 304, 340, 649]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 390 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 745/1194 places, 690/1158 transitions.
Applied a total of 0 rules in 43 ms. Remains 745 /745 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1327 ms. Remains : 745/1194 places, 690/1158 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), p1, p1, true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Computed a total of 745 stabilizing places and 690 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 745 transition count 690
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), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 finished in 2654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||!(p2 U p0)))'
Support contains 5 out of 1194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 766 are kept as prefixes of interest. Removing 428 places using SCC suffix rule.2 ms
Discarding 428 places :
Also discarding 408 output transitions
Drop transitions (Output transitions of discarded places.) removed 408 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 0 with 529 rules applied. Total rules applied 530 place count 711 transition count 254
Reduce places removed 485 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 518 rules applied. Total rules applied 1048 place count 226 transition count 221
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 1073 place count 204 transition count 218
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1076 place count 201 transition count 218
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 1076 place count 201 transition count 142
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1250 place count 103 transition count 142
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 21 rules applied. Total rules applied 1271 place count 103 transition count 121
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1292 place count 82 transition count 121
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1314 place count 60 transition count 79
Iterating global reduction 6 with 22 rules applied. Total rules applied 1336 place count 60 transition count 79
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 30 rules applied. Total rules applied 1366 place count 59 transition count 50
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1377 place count 48 transition count 50
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1377 place count 48 transition count 40
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1397 place count 38 transition count 40
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1403 place count 32 transition count 34
Iterating global reduction 8 with 6 rules applied. Total rules applied 1409 place count 32 transition count 34
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1413 place count 28 transition count 30
Iterating global reduction 8 with 4 rules applied. Total rules applied 1417 place count 28 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1423 place count 25 transition count 27
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1424 place count 24 transition count 26
Iterating global reduction 8 with 1 rules applied. Total rules applied 1425 place count 24 transition count 26
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1426 place count 23 transition count 25
Iterating global reduction 8 with 1 rules applied. Total rules applied 1427 place count 23 transition count 25
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1430 place count 20 transition count 22
Applied a total of 1430 rules in 29 ms. Remains 20 /1194 variables (removed 1174) and now considering 22/1158 (removed 1136) transitions.
// Phase 1: matrix 22 rows 20 cols
[2024-06-01 21:02:13] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 21:02:13] [INFO ] Implicit Places using invariants in 32 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/1194 places, 22/1158 transitions.
Graph (complete) has 20 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 14 /18 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-06-01 21:02:13] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 21:02:13] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 21:02:13] [INFO ] Invariant cache hit.
[2024-06-01 21:02:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/1194 places, 18/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 14/1194 places, 18/1158 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND p0 p1), p1, p0]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
Stuttering acceptance computed with spot in 105 ms :[p0, true, true]
Support contains 33 out of 1194 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1194/1194 places, 1158/1158 transitions.
Graph (complete) has 1645 edges and 1194 vertex of which 811 are kept as prefixes of interest. Removing 383 places using SCC suffix rule.2 ms
Discarding 383 places :
Also discarding 364 output transitions
Drop transitions (Output transitions of discarded places.) removed 364 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 449 rules applied. Total rules applied 450 place count 778 transition count 356
Reduce places removed 427 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 460 rules applied. Total rules applied 910 place count 351 transition count 323
Reduce places removed 22 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 44 rules applied. Total rules applied 954 place count 329 transition count 301
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 976 place count 307 transition count 301
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 976 place count 307 transition count 204
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1214 place count 166 transition count 204
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1236 place count 166 transition count 182
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1258 place count 144 transition count 182
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1272 place count 130 transition count 158
Iterating global reduction 6 with 14 rules applied. Total rules applied 1286 place count 130 transition count 158
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1287 place count 130 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1288 place count 129 transition count 157
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1288 place count 129 transition count 144
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1314 place count 116 transition count 144
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1315 place count 115 transition count 133
Iterating global reduction 8 with 1 rules applied. Total rules applied 1316 place count 115 transition count 133
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 22 rules applied. Total rules applied 1338 place count 114 transition count 112
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1348 place count 104 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1348 place count 104 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1350 place count 103 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1353 place count 101 transition count 110
Applied a total of 1353 rules in 38 ms. Remains 101 /1194 variables (removed 1093) and now considering 110/1158 (removed 1048) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-06-01 21:02:13] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 21:02:13] [INFO ] Implicit Places using invariants in 54 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 99/1194 places, 110/1158 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 99 transition count 99
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 88 transition count 99
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 88 transition count 88
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 77 transition count 88
Applied a total of 44 rules in 4 ms. Remains 77 /99 variables (removed 22) and now considering 88/110 (removed 22) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-06-01 21:02:13] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 21:02:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 21:02:14] [INFO ] Invariant cache hit.
[2024-06-01 21:02:14] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 77/1194 places, 88/1158 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 193 ms. Remains : 77/1194 places, 88/1158 transitions.
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
Product exploration explored 100000 steps with 2990 reset in 194 ms.
Product exploration explored 100000 steps with 2996 reset in 219 ms.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0]
RANDOM walk for 137 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 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 135 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0]
[2024-06-01 21:02:15] [INFO ] Invariant cache hit.
[2024-06-01 21:02:15] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 21:02:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:02:15] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-01 21:02:15] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 21:02:15] [INFO ] Added : 22 causal constraints over 5 iterations in 81 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 21:02:15] [INFO ] Invariant cache hit.
[2024-06-01 21:02:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 21:02:15] [INFO ] Invariant cache hit.
[2024-06-01 21:02:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 21:02:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1858 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1687 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3556ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3558ms
Finished structural reductions in LTL mode , in 1 iterations and 3692 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 129 ms :[p0, p0, p0]
RANDOM walk for 133 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 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 123 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 132 ms :[p0, p0, p0]
[2024-06-01 21:02:20] [INFO ] Invariant cache hit.
[2024-06-01 21:02:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 21:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:02:20] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 21:02:20] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 21:02:20] [INFO ] Added : 22 causal constraints over 5 iterations in 83 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 136 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 2999 reset in 325 ms.
Product exploration explored 100000 steps with 2993 reset in 360 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 21:02:21] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 21:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1712 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1693 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3413ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3422 ms. Remains : 77/77 places, 88/88 transitions.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 0 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 21:02:25] [INFO ] Invariant cache hit.
[2024-06-01 21:02:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 21:02:25] [INFO ] Invariant cache hit.
[2024-06-01 21:02:25] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 21:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1424 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1677 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3112ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3114ms
Finished structural reductions in LTL mode , in 1 iterations and 3238 ms. Remains : 77/77 places, 88/88 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 14767 ms.
[2024-06-01 21:02:28] [INFO ] Flatten gal took : 93 ms
[2024-06-01 21:02:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 21:02:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1194 places, 1158 transitions and 2826 arcs took 26 ms.
Total runtime 227303 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04

BK_STOP 1717276462254

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
ltl formula formula --ltl=/tmp/1259/ltl_0_
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 1194 places, 1158 transitions and 2826 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1259/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): There are 1172 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1195, there are 1163 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~601 levels ~10000 states ~33260 transitions
pnml2lts-mc( 1/ 4): ~601 levels ~20000 states ~50616 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~40000 states ~66292 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~80000 states ~116780 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~160000 states ~229044 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~320000 states ~453448 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~640000 states ~912416 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~1280000 states ~1839312 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~2560000 states ~3921628 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~5120000 states ~8416916 transitions
pnml2lts-mc( 2/ 4): ~541 levels ~10240000 states ~17401244 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14866058
pnml2lts-mc( 0/ 4): unique states count: 14868339
pnml2lts-mc( 0/ 4): unique transitions count: 59825552
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 44938366
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14868342
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2389
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14868342 states 59825588 transitions, fanout: 4.024
pnml2lts-mc( 0/ 4): Total exploration time 712.040 sec (712.010 sec minimum, 712.023 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20881, Transitions per second: 84020
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 177.6MB, 12.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 44.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1188 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 177.6MB (~256.0MB paged-in)

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="LTLCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636267000483"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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