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.r158-smll-171636267000508.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 itstools
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636267000508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 461K Apr 11 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 11 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 660K Apr 11 21:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 11 21: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 149K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 584K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 407K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 854K Apr 11 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 11 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 43K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K 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 17M 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-L00100M0010C005P005G002-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716702233178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 05:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 05:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:43:57] [INFO ] Load time of PNML (sax parser for PT used): 1871 ms
[2024-05-26 05:43:57] [INFO ] Transformed 40605 places.
[2024-05-26 05:43:57] [INFO ] Transformed 36871 transitions.
[2024-05-26 05:43:57] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 2285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 160 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4779 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 341 places and 0 transitions.
Discarding 6661 places :
Implicit places reduction removed 6661 places
Iterating post reduction 0 with 7002 rules applied. Total rules applied 7002 place count 33572 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 7204 place count 33370 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 7406 place count 33370 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7408 place count 33368 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 7410 place count 33368 transition count 36265
Applied a total of 7410 rules in 2257 ms. Remains 33368 /40574 variables (removed 7206) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33368 cols
[2024-05-26 05:44:04] [INFO ] Computed 1929 invariants in 3128 ms
[2024-05-26 05:44:48] [INFO ] Performed 24537/33368 implicitness test of which 606 returned IMPLICIT in 30 seconds.
[2024-05-26 05:45:01] [INFO ] Implicit Places using invariants in 60452 ms returned [707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 10918, 10919, 10920, 10921, 10922, 10923, 10924, 10925, 10926, 10927, 10928, 10929, 10930, 10931, 10932, 10933, 10934, 10935, 10936, 10937, 10938, 10939, 10940, 10941, 10942, 10943, 10944, 10945, 10946, 10947, 10948, 10949, 10950, 10951, 10952, 10953, 10954, 10955, 10956, 10957, 10958, 10959, 10960, 10961, 10962, 10963, 10964, 10965, 10966, 10967, 10968, 10969, 10970, 10971, 10972, 10973, 10974, 10975, 10976, 10977, 10978, 10979, 10980, 10981, 10982, 10983, 10984, 10985, 10986, 10987, 10988, 10989, 10990, 10991, 10992, 10993, 10994, 10995, 10996, 10997, 10998, 10999, 11000, 11001, 11002, 11003, 11004, 11005, 11006, 11007, 11008, 11009, 11010, 11011, 11012, 11013, 11014, 11015, 11016, 11017, 11018, 16982, 18195, 18196, 18197, 18198, 18199, 18200, 18201, 18202, 18203, 18204, 18205, 18206, 18207, 18208, 18209, 18210, 18211, 18212, 18213, 18214, 18215, 18216, 18217, 18218, 18219, 18220, 18221, 18222, 18223, 18224, 18225, 18226, 18227, 18228, 18229, 18230, 18231, 18232, 18233, 18234, 18235, 18236, 18237, 18238, 18239, 18240, 18241, 18242, 18243, 18244, 18245, 18246, 18247, 18248, 18249, 18250, 18251, 18252, 18253, 18254, 18255, 18256, 18257, 18258, 18259, 18260, 18261, 18262, 18263, 18264, 18265, 18266, 18267, 18268, 18269, 18270, 18271, 18272, 18273, 18274, 18275, 18276, 18277, 18278, 18279, 18280, 18281, 18282, 18283, 18284, 18285, 18286, 18287, 18288, 18289, 18290, 18291, 18292, 18293, 18294, 18295, 21135, 21136, 21137, 21138, 21139, 21140, 21141, 21142, 21143, 21144, 21145, 21146, 21147, 21148, 21149, 21150, 21151, 21152, 21153, 21154, 21155, 21156, 21157, 21158, 21159, 21160, 21161, 21162, 21163, 21164, 21165, 21166, 21167, 21168, 21169, 21170, 21171, 21172, 21173, 21174, 21175, 21176, 21177, 21178, 21179, 21180, 21181, 21182, 21183, 21184, 21185, 21186, 21187, 21188, 21189, 21190, 21191, 21192, 21193, 21194, 21195, 21196, 21197, 21198, 21199, 21200, 21201, 21202, 21203, 21204, 21205, 21206, 21207, 21208, 21209, 21210, 21211, 21212, 21213, 21214, 21215, 21216, 21217, 21218, 21219, 21220, 21221, 21222, 21223, 21224, 21225, 21226, 21227, 21228, 21229, 21230, 21231, 21232, 21233, 21234, 21235, 21438, 21439, 21440, 21441, 21442, 21443, 21444, 21445, 21446, 21447, 21448, 21449, 21450, 21451, 21452, 21453, 21454, 21455, 21456, 21457, 21458, 21459, 21460, 21461, 21462, 21463, 21464, 21465, 21466, 21467, 21468, 21469, 21470, 21471, 21472, 21473, 21474, 21475, 21476, 21477, 21478, 21479, 21480, 21481, 21482, 21483, 21484, 21485, 21486, 21487, 21488, 21489, 21490, 21491, 21492, 21493, 21494, 21495, 21496, 21497, 21498, 21499, 21500, 21501, 21502, 21503, 21504, 21505, 21506, 21507, 21509, 21510, 21511, 21512, 21513, 21514, 21515, 21516, 21517, 21518, 21519, 21520, 21521, 21522, 21523, 21524, 21525, 21526, 21527, 21528, 21529, 21530, 21531, 21532, 21533, 21534, 21535, 21536, 21537, 21538, 26892, 26893, 26894, 26895, 26896, 26897, 26898, 26899, 26900, 26901, 26902, 26903, 26904, 26905, 26906, 26907, 26908, 26909, 26910, 26911, 26912, 26913, 26914, 26915, 26916, 26917, 26918, 26919, 26920, 26921, 26922, 26923, 26924, 26925, 26926, 26927, 26928, 26929, 26930, 26931, 26932, 26933, 26934, 26935, 26936, 26937, 26938, 26939, 26940, 26941, 26942, 26943, 26944, 26945, 26946, 26947, 26948, 26949, 26950, 26951, 26952, 26953, 26954, 26955, 26956, 26957, 26958, 26959, 26960, 26961, 26962, 26963, 26964, 26965, 26966, 26967, 26968, 26969, 26970, 26971, 26972, 26973, 26974, 26975, 26976, 26977, 26978, 26979, 26980, 26981, 26982, 26983, 26984, 26985, 26986, 26987, 26988, 26989, 26990, 26991, 26992]
Discarding 707 places :
Implicit Place search using SMT only with invariants took 60604 ms to find 707 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32661/40574 places, 36265/36871 transitions.
Applied a total of 0 rules in 290 ms. Remains 32661 /32661 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63186 ms. Remains : 32661/40574 places, 36265/36871 transitions.
Support contains 4779 out of 32661 places after structural reductions.
[2024-05-26 05:45:04] [INFO ] Flatten gal took : 1490 ms
[2024-05-26 05:45:05] [INFO ] Flatten gal took : 974 ms
[2024-05-26 05:45:08] [INFO ] Input system was already deterministic with 36265 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 8494 ms. (4 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 994 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4995 ms. (8 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
// Phase 1: matrix 36265 rows 32661 cols
[2024-05-26 05:45:15] [INFO ] Computed 1222 invariants in 2612 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2027 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 9110ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2027 out of 32661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 32554 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.97 ms
Discarding 107 places :
Also discarding 107 output transitions
Drop transitions (Output transitions of discarded places.) removed 107 transitions
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19071 transitions
Trivial Post-agglo rules discarded 19071 transitions
Performed 19071 trivial Post agglomeration. Transition count delta: 19071
Iterating post reduction 0 with 19076 rules applied. Total rules applied 19077 place count 32549 transition count 17087
Reduce places removed 19071 places and 0 transitions.
Performed 1216 Post agglomeration using F-continuation condition.Transition count delta: 1216
Iterating post reduction 1 with 20287 rules applied. Total rules applied 39364 place count 13478 transition count 15871
Reduce places removed 1216 places and 0 transitions.
Iterating post reduction 2 with 1216 rules applied. Total rules applied 40580 place count 12262 transition count 15871
Performed 2423 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2423 Pre rules applied. Total rules applied 40580 place count 12262 transition count 13448
Deduced a syphon composed of 2423 places in 9 ms
Ensure Unique test removed 908 places
Reduce places removed 3331 places and 0 transitions.
Iterating global reduction 3 with 5754 rules applied. Total rules applied 46334 place count 8931 transition count 13448
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 46940 place count 8931 transition count 12842
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 47546 place count 8325 transition count 12842
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 100 Pre rules applied. Total rules applied 47546 place count 8325 transition count 12742
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 47746 place count 8225 transition count 12742
Discarding 3041 places :
Symmetric choice reduction at 5 with 3041 rule applications. Total rules 50787 place count 5184 transition count 8601
Iterating global reduction 5 with 3041 rules applied. Total rules applied 53828 place count 5184 transition count 8601
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 5 with 909 rules applied. Total rules applied 54737 place count 5083 transition count 7793
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 6 with 303 rules applied. Total rules applied 55040 place count 4780 transition count 7793
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 201 Pre rules applied. Total rules applied 55040 place count 4780 transition count 7592
Deduced a syphon composed of 201 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 7 with 403 rules applied. Total rules applied 55443 place count 4578 transition count 7592
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 55453 place count 4568 transition count 7582
Iterating global reduction 7 with 10 rules applied. Total rules applied 55463 place count 4568 transition count 7582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 55463 place count 4568 transition count 7580
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 55467 place count 4566 transition count 7580
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 55471 place count 4562 transition count 7176
Iterating global reduction 7 with 4 rules applied. Total rules applied 55475 place count 4562 transition count 7176
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Iterating post reduction 7 with 403 rules applied. Total rules applied 55878 place count 4562 transition count 6773
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 56280 place count 4361 transition count 6572
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 56482 place count 4260 transition count 6572
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -396
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 8 with 198 rules applied. Total rules applied 56680 place count 4161 transition count 6968
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 56681 place count 4161 transition count 6967
Free-agglomeration rule applied 1112 times.
Iterating global reduction 8 with 1112 rules applied. Total rules applied 57793 place count 4161 transition count 5855
Reduce places removed 1112 places and 0 transitions.
Iterating post reduction 8 with 1112 rules applied. Total rules applied 58905 place count 3049 transition count 5855
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 58906 place count 3049 transition count 5854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 58907 place count 3048 transition count 5854
Partial Free-agglomeration rule applied 200 times.
Drop transitions (Partial Free agglomeration) removed 200 transitions
Iterating global reduction 10 with 200 rules applied. Total rules applied 59107 place count 3048 transition count 5854
Applied a total of 59107 rules in 7684 ms. Remains 3048 /32661 variables (removed 29613) and now considering 5854/36265 (removed 30411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7686 ms. Remains : 3048/32661 places, 5854/36265 transitions.
RANDOM walk for 40000 steps (48 resets) in 3710 ms. (10 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
// Phase 1: matrix 5854 rows 3048 cols
[2024-05-26 05:45:31] [INFO ] Computed 207 invariants in 115 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2332/2334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 310/2644 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2644 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5450/8094 variables, 2644/2851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8094 variables, 0/2851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 800/8894 variables, 400/3251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8894 variables, 0/3251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/8902 variables, 4/3255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8902 variables, 0/3255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/8902 variables, 0/3255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8902/8902 variables, and 3255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5271 ms.
Refiners :[Generalized P Invariants (flows): 207/207 constraints, State Equation: 3048/3048 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2332/2334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 310/2644 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2644 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5450/8094 variables, 2644/2851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8094 variables, 0/2851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 800/8894 variables, 400/3251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8894 variables, 1/3252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8894 variables, 0/3252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/8902 variables, 4/3256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8902 variables, 0/3256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8902 variables, 0/3256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8902/8902 variables, and 3256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4726 ms.
Refiners :[Generalized P Invariants (flows): 207/207 constraints, State Equation: 3048/3048 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10152ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 413 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 39 ms.
Computed a total of 32661 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32661 transition count 36265
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' '!(X(X(X((G(p0)&&(p1||F(p2)))))))'
Support contains 404 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 32656 transition count 36265
Applied a total of 5 rules in 366 ms. Remains 32656 /32661 variables (removed 5) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32656 cols
[2024-05-26 05:45:45] [INFO ] Computed 1217 invariants in 2648 ms
[2024-05-26 05:46:17] [INFO ] Implicit Places using invariants in 34442 ms returned [20927, 24766, 24767, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866, 31343, 31344, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 34487 ms to find 203 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32453/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 373 ms. Remains 32453 /32453 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35242 ms. Remains : 32453/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 710 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 7 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 finished in 36236 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(F((p0&&F(p1)))))'
Support contains 713 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 32656 transition count 36265
Applied a total of 5 rules in 384 ms. Remains 32656 /32661 variables (removed 5) and now considering 36265/36265 (removed 0) transitions.
[2024-05-26 05:46:18] [INFO ] Invariant cache hit.
[2024-05-26 05:46:42] [INFO ] Implicit Places using invariants in 23345 ms returned [20927, 31343, 31344, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 23377 ms to find 102 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32554/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 246 ms. Remains 32554 /32554 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24012 ms. Remains : 32554/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05
Product exploration explored 100000 steps with 46 reset in 7692 ms.
Product exploration explored 100000 steps with 45 reset in 6691 ms.
Computed a total of 32554 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32554 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 8902 steps (0 resets) in 2068 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 36265 rows 32554 cols
[2024-05-26 05:47:39] [INFO ] Computed 1115 invariants in 2673 ms
Could not prove EG (NOT p0)
[2024-05-26 05:47:49] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 713 out of 32554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32554/32554 places, 36265/36265 transitions.
Graph (complete) has 44339 edges and 32554 vertex of which 25065 are kept as prefixes of interest. Removing 7489 places using SCC suffix rule.97 ms
Discarding 7489 places :
Also discarding 8888 output transitions
Drop transitions (Output transitions of discarded places.) removed 8888 transitions
Reduce places removed 101 places and 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18685 transitions
Trivial Post-agglo rules discarded 18685 transitions
Performed 18685 trivial Post agglomeration. Transition count delta: 18685
Iterating post reduction 0 with 18685 rules applied. Total rules applied 18686 place count 24964 transition count 8591
Reduce places removed 18685 places and 0 transitions.
Iterating post reduction 1 with 18685 rules applied. Total rules applied 37371 place count 6279 transition count 8591
Performed 2121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2121 Pre rules applied. Total rules applied 37371 place count 6279 transition count 6470
Deduced a syphon composed of 2121 places in 2 ms
Ensure Unique test removed 606 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4848 rules applied. Total rules applied 42219 place count 3552 transition count 6470
Discarding 1620 places :
Symmetric choice reduction at 2 with 1620 rule applications. Total rules 43839 place count 1932 transition count 3850
Iterating global reduction 2 with 1620 rules applied. Total rules applied 45459 place count 1932 transition count 3850
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 2 with 1010 rules applied. Total rules applied 46469 place count 1932 transition count 2840
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 46469 place count 1932 transition count 2739
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 46671 place count 1831 transition count 2739
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 46771 place count 1731 transition count 2139
Iterating global reduction 3 with 100 rules applied. Total rules applied 46871 place count 1731 transition count 2139
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 47073 place count 1630 transition count 2038
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 3 with 101 rules applied. Total rules applied 47174 place count 1529 transition count 1937
Applied a total of 47174 rules in 2319 ms. Remains 1529 /32554 variables (removed 31025) and now considering 1937/36265 (removed 34328) transitions.
// Phase 1: matrix 1937 rows 1529 cols
[2024-05-26 05:48:02] [INFO ] Computed 102 invariants in 18 ms
[2024-05-26 05:48:02] [INFO ] Implicit Places using invariants in 498 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1528/32554 places, 1937/36265 transitions.
Reduce places removed 101 places and 101 transitions.
Applied a total of 0 rules in 34 ms. Remains 1427 /1528 variables (removed 101) and now considering 1836/1937 (removed 101) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2855 ms. Remains : 1427/32554 places, 1836/36265 transitions.
Computed a total of 1427 stabilizing places and 1836 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1427 transition count 1836
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 685 steps (0 resets) in 72 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 9 factoid took 764 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 1836 rows 1427 cols
[2024-05-26 05:48:20] [INFO ] Computed 101 invariants in 18 ms
Could not prove EG (NOT p0)
[2024-05-26 05:48:35] [INFO ] Invariant cache hit.
[2024-05-26 05:48:37] [INFO ] [Real]Absence check using 0 positive and 101 generalized place invariants in 75 ms returned sat
[2024-05-26 05:48:38] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2024-05-26 05:48:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:48:40] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 72 ms returned sat
[2024-05-26 05:48:41] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2024-05-26 05:48:42] [INFO ] Computed and/alt/rep : 1224/4860/1224 causal constraints (skipped 6 transitions) in 202 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 575 reset in 3962 ms.
Product exploration explored 100000 steps with 590 reset in 4141 ms.
Built C files in :
/tmp/ltsmin12741975952467207950
[2024-05-26 05:49:02] [INFO ] Too many transitions (1836) to apply POR reductions. Disabling POR matrices.
[2024-05-26 05:49:02] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12741975952467207950
Running compilation step : cd /tmp/ltsmin12741975952467207950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12741975952467207950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12741975952467207950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 713 out of 1427 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1427/1427 places, 1836/1836 transitions.
Applied a total of 0 rules in 28 ms. Remains 1427 /1427 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
[2024-05-26 05:49:05] [INFO ] Invariant cache hit.
[2024-05-26 05:49:05] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-26 05:49:05] [INFO ] Invariant cache hit.
[2024-05-26 05:49:07] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2024-05-26 05:49:07] [INFO ] Redundant transitions in 138 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-26 05:49:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30080 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 60792ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62651 ms. Remains : 1427/1427 places, 1836/1836 transitions.
Built C files in :
/tmp/ltsmin14264092875857436332
[2024-05-26 05:50:08] [INFO ] Too many transitions (1836) to apply POR reductions. Disabling POR matrices.
[2024-05-26 05:50:08] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14264092875857436332
Running compilation step : cd /tmp/ltsmin14264092875857436332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14264092875857436332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14264092875857436332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 05:50:13] [INFO ] Flatten gal took : 68 ms
[2024-05-26 05:50:13] [INFO ] Flatten gal took : 86 ms
[2024-05-26 05:50:13] [INFO ] Time to serialize gal into /tmp/LTL8356337277343894533.gal : 36 ms
[2024-05-26 05:50:13] [INFO ] Time to serialize properties into /tmp/LTL10481426211412617300.prop : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8356337277343894533.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7892233812403472982.hoa' '-atoms' '/tmp/LTL10481426211412617300.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10481426211412617300.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7892233812403472982.hoa
Detected timeout of ITS tools.
[2024-05-26 05:50:28] [INFO ] Flatten gal took : 53 ms
[2024-05-26 05:50:29] [INFO ] Flatten gal took : 56 ms
[2024-05-26 05:50:29] [INFO ] Time to serialize gal into /tmp/LTL12173910905801658494.gal : 11 ms
[2024-05-26 05:50:29] [INFO ] Time to serialize properties into /tmp/LTL6698828960950057652.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12173910905801658494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6698828960950057652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((p7_5>=1)||(p7_2>=1))||((p7_1>=1)||(p7_4>=1)))||((p7_3>=1)||(p7_0>=1)))"))&&("((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((...19399
Formula 0 simplified : XG(!"((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((lc0_70>=1)&&(cl1_70_4>=1)))||(((lc0_27>=1)&&(cl1_27_2>=1))||((lc0_3>=1)&&(cl1_3_1>=1)...19391
Detected timeout of ITS tools.
[2024-05-26 05:50:44] [INFO ] Flatten gal took : 82 ms
[2024-05-26 05:50:44] [INFO ] Applying decomposition
[2024-05-26 05:50:44] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15802304140144929215.txt' '-o' '/tmp/graph15802304140144929215.bin' '-w' '/tmp/graph15802304140144929215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15802304140144929215.bin' '-l' '-1' '-v' '-w' '/tmp/graph15802304140144929215.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:50:44] [INFO ] Decomposing Gal with order
[2024-05-26 05:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:50:45] [INFO ] Removed a total of 1614 redundant transitions.
[2024-05-26 05:50:45] [INFO ] Flatten gal took : 210 ms
[2024-05-26 05:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 523 labels/synchronizations in 55 ms.
[2024-05-26 05:50:45] [INFO ] Time to serialize gal into /tmp/LTL8554405166361514075.gal : 30 ms
[2024-05-26 05:50:45] [INFO ] Time to serialize properties into /tmp/LTL83862976243386978.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8554405166361514075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL83862976243386978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((i0.u712.p7_5>=1)||(i0.u711.p7_2>=1))||((i0.u708.p7_1>=1)||(i0.u710.p7_4>=1)))||((i0.u709.p7_3>=1)||(i0.u707.p7_0>=1)))"...29443
Formula 0 simplified : XG(!"((((((((((((i54.u66.lc0_46>=1)&&(i54.u586.cl1_46_3>=1))||((i65.u80.lc0_70>=1)&&(i65.u339.cl1_70_4>=1)))||(((i45.u55.lc0_27>=1)&...29435
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 finished in 282714 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&&F(p1)) U (p2 U (X(F(!p4))||p3))))'
Support contains 3535 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 32656 transition count 36265
Applied a total of 5 rules in 277 ms. Remains 32656 /32661 variables (removed 5) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32656 cols
[2024-05-26 05:51:04] [INFO ] Computed 1217 invariants in 2908 ms
[2024-05-26 05:51:28] [INFO ] Implicit Places using invariants in 26638 ms returned [20927, 24766, 24767, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 26659 ms to find 102 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32554/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 167 ms. Remains 32554 /32554 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27106 ms. Remains : 32554/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p3) p4), p4, (AND (NOT p1) p4), (AND (NOT p3) p4), (AND (NOT p3) p4)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06
Product exploration timeout after 34050 steps with 17025 reset in 10002 ms.
Product exploration timeout after 31050 steps with 15525 reset in 10001 ms.
Computed a total of 32554 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32554 transition count 36265
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 p3) (NOT p2) (NOT p0) (NOT p1) (NOT p4)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4))), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2) p4))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0 p4))), (X (NOT p4)), (X (NOT (AND (NOT p3) p2 (NOT p0) p4))), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) p2 p4))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2) p4)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p4)))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p2 p4)))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p4)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 30 factoid took 37 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 finished in 96954 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(p0)))'
Support contains 101 out of 32661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 27394 are kept as prefixes of interest. Removing 5267 places using SCC suffix rule.41 ms
Discarding 5267 places :
Also discarding 6167 output transitions
Drop transitions (Output transitions of discarded places.) removed 6167 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20603 transitions
Trivial Post-agglo rules discarded 20603 transitions
Performed 20603 trivial Post agglomeration. Transition count delta: 20603
Iterating post reduction 0 with 20608 rules applied. Total rules applied 20609 place count 27288 transition count 9394
Reduce places removed 20603 places and 0 transitions.
Iterating post reduction 1 with 20603 rules applied. Total rules applied 41212 place count 6685 transition count 9394
Performed 1515 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1515 Pre rules applied. Total rules applied 41212 place count 6685 transition count 7879
Deduced a syphon composed of 1515 places in 4 ms
Ensure Unique test removed 606 places
Reduce places removed 2121 places and 0 transitions.
Iterating global reduction 2 with 3636 rules applied. Total rules applied 44848 place count 4564 transition count 7879
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 45454 place count 4564 transition count 7273
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 46060 place count 3958 transition count 7273
Discarding 2535 places :
Symmetric choice reduction at 4 with 2535 rule applications. Total rules 48595 place count 1423 transition count 3738
Iterating global reduction 4 with 2535 rules applied. Total rules applied 51130 place count 1423 transition count 3738
Ensure Unique test removed 1515 transitions
Reduce isomorphic transitions removed 1515 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 4 with 1919 rules applied. Total rules applied 53049 place count 1322 transition count 1920
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 5 with 303 rules applied. Total rules applied 53352 place count 1019 transition count 1920
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 203 Pre rules applied. Total rules applied 53352 place count 1019 transition count 1717
Deduced a syphon composed of 203 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 407 rules applied. Total rules applied 53759 place count 815 transition count 1717
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 53764 place count 810 transition count 1212
Iterating global reduction 6 with 5 rules applied. Total rules applied 53769 place count 810 transition count 1212
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 6 with 707 rules applied. Total rules applied 54476 place count 709 transition count 606
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 54577 place count 608 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 54577 place count 608 transition count 505
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 54779 place count 507 transition count 505
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 8 with 101 rules applied. Total rules applied 54880 place count 406 transition count 404
Applied a total of 54880 rules in 1646 ms. Remains 406 /32661 variables (removed 32255) and now considering 404/36265 (removed 35861) transitions.
// Phase 1: matrix 404 rows 406 cols
[2024-05-26 05:52:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-26 05:52:39] [INFO ] Implicit Places using invariants in 306 ms returned [101, 102]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 321 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/32661 places, 404/36265 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 303 transition count 202
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 202 transition count 202
Applied a total of 202 rules in 9 ms. Remains 202 /404 variables (removed 202) and now considering 202/404 (removed 202) transitions.
// Phase 1: matrix 202 rows 202 cols
[2024-05-26 05:52:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:52:40] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-26 05:52:40] [INFO ] Invariant cache hit.
[2024-05-26 05:52:40] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 202/32661 places, 202/36265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2237 ms. Remains : 202/32661 places, 202/36265 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 finished in 2371 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((((G(F(p0))&&X(p1)) U p0)&&p2))))'
Support contains 5 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 32657 transition count 36265
Applied a total of 4 rules in 371 ms. Remains 32657 /32661 variables (removed 4) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32657 cols
[2024-05-26 05:52:43] [INFO ] Computed 1218 invariants in 2544 ms
[2024-05-26 05:53:14] [INFO ] Implicit Places using invariants in 34108 ms returned [20928, 24767, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866, 24867, 31344, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443, 31444]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 34147 ms to find 203 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32454/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 231 ms. Remains 32454 /32454 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34751 ms. Remains : 32454/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08
Stuttering criterion allowed to conclude after 5781 steps with 0 reset in 248 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 finished in 35384 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 2 out of 32661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 31241 are kept as prefixes of interest. Removing 1420 places using SCC suffix rule.54 ms
Discarding 1420 places :
Also discarding 1521 output transitions
Drop transitions (Output transitions of discarded places.) removed 1521 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21910 transitions
Trivial Post-agglo rules discarded 21910 transitions
Performed 21910 trivial Post agglomeration. Transition count delta: 21910
Iterating post reduction 0 with 21915 rules applied. Total rules applied 21916 place count 31135 transition count 12733
Reduce places removed 21910 places and 0 transitions.
Iterating post reduction 1 with 21910 rules applied. Total rules applied 43826 place count 9225 transition count 12733
Performed 2222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2222 Pre rules applied. Total rules applied 43826 place count 9225 transition count 10511
Deduced a syphon composed of 2222 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 3131 places and 0 transitions.
Iterating global reduction 2 with 5353 rules applied. Total rules applied 49179 place count 6094 transition count 10511
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 49785 place count 6094 transition count 9905
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 50391 place count 5488 transition count 9905
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 50391 place count 5488 transition count 9804
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 50593 place count 5387 transition count 9804
Discarding 3645 places :
Symmetric choice reduction at 4 with 3645 rule applications. Total rules 54238 place count 1742 transition count 4960
Iterating global reduction 4 with 3645 rules applied. Total rules applied 57883 place count 1742 transition count 4960
Ensure Unique test removed 1515 transitions
Reduce isomorphic transitions removed 1515 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 4 with 1919 rules applied. Total rules applied 59802 place count 1641 transition count 3142
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 5 with 303 rules applied. Total rules applied 60105 place count 1338 transition count 3142
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 203 Pre rules applied. Total rules applied 60105 place count 1338 transition count 2939
Deduced a syphon composed of 203 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 407 rules applied. Total rules applied 60512 place count 1134 transition count 2939
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 60522 place count 1124 transition count 2429
Iterating global reduction 6 with 10 rules applied. Total rules applied 60532 place count 1124 transition count 2429
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 6 with 606 rules applied. Total rules applied 61138 place count 1124 transition count 1823
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 61239 place count 1023 transition count 1823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 61239 place count 1023 transition count 1822
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 61241 place count 1022 transition count 1822
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 61246 place count 1017 transition count 1317
Iterating global reduction 8 with 5 rules applied. Total rules applied 61251 place count 1017 transition count 1317
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 8 with 908 rules applied. Total rules applied 62159 place count 815 transition count 611
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 9 with 201 rules applied. Total rules applied 62360 place count 614 transition count 611
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 62360 place count 614 transition count 409
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 62764 place count 412 transition count 409
Discarding 99 places :
Symmetric choice reduction at 10 with 99 rule applications. Total rules 62863 place count 313 transition count 310
Iterating global reduction 10 with 99 rules applied. Total rules applied 62962 place count 313 transition count 310
Discarding 99 places :
Symmetric choice reduction at 10 with 99 rule applications. Total rules 63061 place count 214 transition count 211
Iterating global reduction 10 with 99 rules applied. Total rules applied 63160 place count 214 transition count 211
Discarding 99 places :
Symmetric choice reduction at 10 with 99 rule applications. Total rules 63259 place count 115 transition count 112
Iterating global reduction 10 with 99 rules applied. Total rules applied 63358 place count 115 transition count 112
Discarding 99 places :
Symmetric choice reduction at 10 with 99 rule applications. Total rules 63457 place count 16 transition count 13
Iterating global reduction 10 with 99 rules applied. Total rules applied 63556 place count 16 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 63558 place count 14 transition count 11
Applied a total of 63558 rules in 2596 ms. Remains 14 /32661 variables (removed 32647) and now considering 11/36265 (removed 36254) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-26 05:53:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 05:53:18] [INFO ] Implicit Places using invariants in 42 ms returned [2, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32661 places, 11/36265 transitions.
Reduce places removed 2 places and 2 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 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 5 transition count 5
Applied a total of 8 rules in 0 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-26 05:53:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 05:53:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-26 05:53:18] [INFO ] Invariant cache hit.
[2024-05-26 05:53:18] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32661 places, 5/36265 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2691 ms. Remains : 4/32661 places, 5/36265 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 finished in 2772 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(X(F((!(G(p0) U !p0)||(p1 U !F(p2)))))))'
Support contains 3 out of 32661 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 16144 are kept as prefixes of interest. Removing 16517 places using SCC suffix rule.71 ms
Discarding 16517 places :
Also discarding 18117 output transitions
Drop transitions (Output transitions of discarded places.) removed 18117 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14594 transitions
Trivial Post-agglo rules discarded 14594 transitions
Performed 14594 trivial Post agglomeration. Transition count delta: 14594
Iterating post reduction 0 with 14598 rules applied. Total rules applied 14599 place count 16039 transition count 3453
Reduce places removed 14594 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14595 rules applied. Total rules applied 29194 place count 1445 transition count 3452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29195 place count 1444 transition count 3452
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 29195 place count 1444 transition count 3350
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 29399 place count 1342 transition count 3350
Discarding 1118 places :
Symmetric choice reduction at 3 with 1118 rule applications. Total rules 30517 place count 224 transition count 1252
Iterating global reduction 3 with 1118 rules applied. Total rules applied 31635 place count 224 transition count 1252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 31635 place count 224 transition count 1250
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31639 place count 222 transition count 1250
Discarding 108 places :
Symmetric choice reduction at 3 with 108 rule applications. Total rules 31747 place count 114 transition count 1122
Iterating global reduction 3 with 108 rules applied. Total rules applied 31855 place count 114 transition count 1122
Ensure Unique test removed 1009 transitions
Reduce isomorphic transitions removed 1009 transitions.
Iterating post reduction 3 with 1009 rules applied. Total rules applied 32864 place count 114 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 32864 place count 114 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 32866 place count 113 transition count 112
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 32963 place count 16 transition count 15
Iterating global reduction 4 with 97 rules applied. Total rules applied 33060 place count 16 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 33063 place count 13 transition count 12
Applied a total of 33063 rules in 1016 ms. Remains 13 /32661 variables (removed 32648) and now considering 12/36265 (removed 36253) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-26 05:53:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 05:53:19] [INFO ] Implicit Places using invariants in 27 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/32661 places, 12/36265 transitions.
Graph (complete) has 11 edges and 12 vertex of which 11 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
Reduce places removed 2 places and 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 05:53:19] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 05:53:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 05:53:19] [INFO ] Invariant cache hit.
[2024-05-26 05:53:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/32661 places, 9/36265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1095 ms. Remains : 9/32661 places, 9/36265 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10
Product exploration explored 100000 steps with 14309 reset in 142 ms.
Product exploration explored 100000 steps with 14291 reset in 202 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 37 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 finished in 1649 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(X((p1&&X(G(p2)))))))'
Support contains 4 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 32656 transition count 36265
Applied a total of 5 rules in 332 ms. Remains 32656 /32661 variables (removed 5) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32656 cols
[2024-05-26 05:53:23] [INFO ] Computed 1217 invariants in 2517 ms
[2024-05-26 05:53:47] [INFO ] Implicit Places using invariants in 26933 ms returned [24766, 24767, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866, 31343, 31344, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 26962 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32454/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 229 ms. Remains 32454 /32454 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27526 ms. Remains : 32454/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 finished in 27901 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 2 out of 32661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 15 are kept as prefixes of interest. Removing 32646 places using SCC suffix rule.27 ms
Discarding 32646 places :
Also discarding 36241 output transitions
Drop transitions (Output transitions of discarded places.) removed 36241 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 14 transition count 6
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 26 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 5 transition count 5
Applied a total of 28 rules in 72 ms. Remains 5 /32661 variables (removed 32656) and now considering 5/36265 (removed 36260) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-26 05:53:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-26 05:53:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-26 05:53:48] [INFO ] Invariant cache hit.
[2024-05-26 05:53:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-26 05:53:48] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-26 05:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 71 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 51 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/32661 places, 5/36265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 5/32661 places, 5/36265 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13
Product exploration explored 100000 steps with 28615 reset in 96 ms.
Product exploration explored 100000 steps with 28483 reset in 125 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 21 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-L00100M0010C005P005G002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 finished in 621 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(F(((G(!p0) U p1)&&G(F(p2))))))'
Support contains 3 out of 32661 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 32656 transition count 36265
Applied a total of 5 rules in 399 ms. Remains 32656 /32661 variables (removed 5) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32656 cols
[2024-05-26 05:53:51] [INFO ] Computed 1217 invariants in 2604 ms
[2024-05-26 05:54:18] [INFO ] Implicit Places using invariants in 29150 ms returned [20927, 24766, 24767, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866, 31343, 31344, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 29173 ms to find 203 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32453/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 229 ms. Remains 32453 /32453 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29803 ms. Remains : 32453/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14
Stuttering criterion allowed to conclude after 5783 steps with 0 reset in 223 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 finished in 30570 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)&&X((p1||(p2 U p3))))))'
Support contains 6 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 32658 transition count 36265
Applied a total of 3 rules in 386 ms. Remains 32658 /32661 variables (removed 3) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 32658 cols
[2024-05-26 05:54:21] [INFO ] Computed 1219 invariants in 2218 ms
[2024-05-26 05:54:47] [INFO ] Implicit Places using invariants in 27742 ms returned [20929, 24768, 24769, 24770, 24771, 24772, 24773, 24774, 24775, 24776, 24777, 24778, 24779, 24780, 24781, 24782, 24783, 24784, 24785, 24786, 24787, 24788, 24789, 24790, 24791, 24792, 24793, 24794, 24795, 24796, 24797, 24798, 24799, 24800, 24801, 24802, 24803, 24804, 24805, 24806, 24807, 24808, 24809, 24810, 24811, 24812, 24813, 24814, 24815, 24816, 24817, 24818, 24819, 24820, 24821, 24822, 24823, 24824, 24825, 24826, 24827, 24828, 24829, 24830, 24831, 24832, 24833, 24834, 24835, 24836, 24837, 24838, 24839, 24840, 24841, 24842, 24843, 24844, 24845, 24846, 24847, 24848, 24849, 24850, 24851, 24852, 24853, 24854, 24855, 24856, 24857, 24858, 24859, 24860, 24861, 24862, 24863, 24864, 24865, 24866, 24867, 24868, 31345, 31346, 31347, 31348, 31349, 31350, 31351, 31352, 31353, 31354, 31355, 31356, 31357, 31358, 31359, 31360, 31361, 31362, 31363, 31364, 31365, 31366, 31367, 31368, 31369, 31370, 31371, 31372, 31373, 31374, 31375, 31376, 31377, 31378, 31379, 31380, 31381, 31382, 31383, 31384, 31385, 31386, 31387, 31388, 31389, 31390, 31391, 31392, 31393, 31394, 31395, 31396, 31397, 31398, 31399, 31400, 31401, 31402, 31403, 31404, 31405, 31406, 31407, 31408, 31409, 31410, 31411, 31412, 31413, 31414, 31415, 31416, 31417, 31418, 31419, 31420, 31421, 31422, 31423, 31424, 31425, 31426, 31427, 31428, 31429, 31430, 31431, 31432, 31433, 31434, 31435, 31436, 31437, 31438, 31439, 31440, 31441, 31442, 31443, 31444, 31445]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 27768 ms to find 203 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32455/32661 places, 36265/36265 transitions.
Applied a total of 0 rules in 209 ms. Remains 32455 /32455 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28364 ms. Remains : 32455/32661 places, 36265/36265 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15
Stuttering criterion allowed to conclude after 5782 steps with 0 reset in 181 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 finished in 29027 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(F((p0&&F(p1)))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 713 out of 32661 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32661/32661 places, 36265/36265 transitions.
Graph (complete) has 44553 edges and 32661 vertex of which 25071 are kept as prefixes of interest. Removing 7590 places using SCC suffix rule.47 ms
Discarding 7590 places :
Also discarding 8888 output transitions
Drop transitions (Output transitions of discarded places.) removed 8888 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18685 transitions
Trivial Post-agglo rules discarded 18685 transitions
Performed 18685 trivial Post agglomeration. Transition count delta: 18685
Iterating post reduction 0 with 18690 rules applied. Total rules applied 18691 place count 24965 transition count 8591
Reduce places removed 18685 places and 0 transitions.
Iterating post reduction 1 with 18685 rules applied. Total rules applied 37376 place count 6280 transition count 8591
Performed 2120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2120 Pre rules applied. Total rules applied 37376 place count 6280 transition count 6471
Deduced a syphon composed of 2120 places in 2 ms
Ensure Unique test removed 606 places
Reduce places removed 2726 places and 0 transitions.
Iterating global reduction 2 with 4846 rules applied. Total rules applied 42222 place count 3554 transition count 6471
Discarding 1620 places :
Symmetric choice reduction at 2 with 1620 rule applications. Total rules 43842 place count 1934 transition count 3851
Iterating global reduction 2 with 1620 rules applied. Total rules applied 45462 place count 1934 transition count 3851
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
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 2 with 1011 rules applied. Total rules applied 46473 place count 1934 transition count 2840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46474 place count 1933 transition count 2840
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 46474 place count 1933 transition count 2739
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 46676 place count 1832 transition count 2739
Discarding 99 places :
Symmetric choice reduction at 4 with 99 rule applications. Total rules 46775 place count 1733 transition count 2145
Iterating global reduction 4 with 99 rules applied. Total rules applied 46874 place count 1733 transition count 2145
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 47076 place count 1632 transition count 2044
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 4 with 101 rules applied. Total rules applied 47177 place count 1531 transition count 1943
Applied a total of 47177 rules in 1846 ms. Remains 1531 /32661 variables (removed 31130) and now considering 1943/36265 (removed 34322) transitions.
// Phase 1: matrix 1943 rows 1531 cols
[2024-05-26 05:54:50] [INFO ] Computed 103 invariants in 19 ms
[2024-05-26 05:54:51] [INFO ] Implicit Places using invariants in 584 ms returned [101, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 586 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1529/32661 places, 1943/36265 transitions.
Reduce places removed 101 places and 101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1427 transition count 1836
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1427 transition count 1836
Applied a total of 2 rules in 48 ms. Remains 1427 /1529 variables (removed 102) and now considering 1836/1943 (removed 107) transitions.
// Phase 1: matrix 1836 rows 1427 cols
[2024-05-26 05:54:51] [INFO ] Computed 101 invariants in 12 ms
[2024-05-26 05:54:51] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-26 05:54:51] [INFO ] Invariant cache hit.
[2024-05-26 05:54:52] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1427/32661 places, 1836/36265 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4113 ms. Remains : 1427/32661 places, 1836/36265 transitions.
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05
Product exploration explored 100000 steps with 598 reset in 3951 ms.
Product exploration explored 100000 steps with 592 reset in 3964 ms.
Computed a total of 1427 stabilizing places and 1836 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1427 transition count 1836
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 661 steps (0 resets) in 71 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-26 05:55:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-26 05:55:21] [INFO ] Invariant cache hit.
[2024-05-26 05:55:23] [INFO ] [Real]Absence check using 0 positive and 101 generalized place invariants in 66 ms returned sat
[2024-05-26 05:55:24] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2024-05-26 05:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:55:26] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 59 ms returned sat
[2024-05-26 05:55:27] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2024-05-26 05:55:28] [INFO ] Computed and/alt/rep : 1224/4860/1224 causal constraints (skipped 6 transitions) in 304 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 05:55:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 713 out of 1427 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1427/1427 places, 1836/1836 transitions.
Applied a total of 0 rules in 28 ms. Remains 1427 /1427 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
[2024-05-26 05:55:39] [INFO ] Invariant cache hit.
[2024-05-26 05:55:39] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-26 05:55:39] [INFO ] Invariant cache hit.
[2024-05-26 05:55:41] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
[2024-05-26 05:55:41] [INFO ] Redundant transitions in 155 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-26 05:55:41] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30054 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s101 12)
(s102 12)
(s103 12)
(s104 12)
(s105 12)
(s106 12)
(s107 12)
(s108 12)
(s109 12)
(s110 12)
(s111 12)
(s112 12)
(s113 12)
(s114 12)
(s115 12)
(s116 12)
(s117 12)
(s118 12)
(s119 12)
(s120 12)
(s121 12)
(s122 12)
(s123 12)
(s124 12)
(s125 12)
(s126 12)
(s127 12)
(s128 12)
(s129 12)
(s130 12)
(s131 12)
(s132 12)
(s133 12)
(s134 12)
(s135 12)
(s136 12)
(s137 12)
(s138 12)
(s139 12)
(s140 12)
(s141 12)
(s142 12)
(s143 12)
(s144 12)
(s145 12)
(s146 12)
(s147 12)
(s148 12)
(s149 12)
(s150 12)
(s151 12)
(s152 12)
(s153 12)
(s154 12)
(s155 12)
(s156 12)
(s157 12)
(s158 12)
(s159 12)
(s160 12)
(s161 12)
(s162 12)
(s163 12)
(s164 12)
(s165 12)
(s166 12)
(s167 12)
(s168 12)
(s169 12)
(s170 12)
(s171 12)
(s172 12)
(s173 12)
(s174 12)
(s175 12)
(s176 12)
(s177 12)
(s178 12)
(s179 12)
(s180 12)
(s181 12)
(s182 12)
(s183 12)
(s184 12)
(s185 12)
(s186 12)
(s187 12)
(s188 12)
(s189 12)
(s190 12)
(s191 12)
(s192 12)
(s193 12)
(s194 12)
(s195 12)
(s196 12)
(s197 12)
(s198 12)
(s199 12)
(s200 12)
(s201 12)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 60868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62412 ms. Remains : 1427/1427 places, 1836/1836 transitions.
Computed a total of 1427 stabilizing places and 1836 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1427 transition count 1836
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 513 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 786 steps (0 resets) in 117 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 9 factoid took 829 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-26 05:57:00] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-26 05:57:15] [INFO ] Invariant cache hit.
[2024-05-26 05:57:17] [INFO ] [Real]Absence check using 0 positive and 101 generalized place invariants in 75 ms returned sat
[2024-05-26 05:57:18] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2024-05-26 05:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:57:20] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 68 ms returned sat
[2024-05-26 05:57:21] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2024-05-26 05:57:21] [INFO ] Computed and/alt/rep : 1224/4860/1224 causal constraints (skipped 6 transitions) in 140 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 595 reset in 4402 ms.
Product exploration explored 100000 steps with 594 reset in 4033 ms.
Built C files in :
/tmp/ltsmin7882662268618915569
[2024-05-26 05:57:42] [INFO ] Too many transitions (1836) to apply POR reductions. Disabling POR matrices.
[2024-05-26 05:57:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7882662268618915569
Running compilation step : cd /tmp/ltsmin7882662268618915569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7882662268618915569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7882662268618915569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 713 out of 1427 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1427/1427 places, 1836/1836 transitions.
Applied a total of 0 rules in 42 ms. Remains 1427 /1427 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
[2024-05-26 05:57:45] [INFO ] Invariant cache hit.
[2024-05-26 05:57:45] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-26 05:57:45] [INFO ] Invariant cache hit.
[2024-05-26 05:57:46] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2024-05-26 05:57:47] [INFO ] Redundant transitions in 55 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-26 05:57:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1326 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/3263 variables, and 101 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 101/101 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62309 ms. Remains : 1427/1427 places, 1836/1836 transitions.
Built C files in :
/tmp/ltsmin1577381082245983307
[2024-05-26 05:58:47] [INFO ] Too many transitions (1836) to apply POR reductions. Disabling POR matrices.
[2024-05-26 05:58:47] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1577381082245983307
Running compilation step : cd /tmp/ltsmin1577381082245983307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1577381082245983307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1577381082245983307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 05:58:51] [INFO ] Flatten gal took : 79 ms
[2024-05-26 05:58:51] [INFO ] Flatten gal took : 90 ms
[2024-05-26 05:58:51] [INFO ] Time to serialize gal into /tmp/LTL17681451796151144581.gal : 8 ms
[2024-05-26 05:58:51] [INFO ] Time to serialize properties into /tmp/LTL8920048518845883219.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17681451796151144581.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15097163944584381425.hoa' '-atoms' '/tmp/LTL8920048518845883219.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8920048518845883219.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15097163944584381425.hoa
Detected timeout of ITS tools.
[2024-05-26 05:59:06] [INFO ] Flatten gal took : 43 ms
[2024-05-26 05:59:07] [INFO ] Flatten gal took : 42 ms
[2024-05-26 05:59:07] [INFO ] Time to serialize gal into /tmp/LTL14394053310263233109.gal : 8 ms
[2024-05-26 05:59:07] [INFO ] Time to serialize properties into /tmp/LTL931855423965869091.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14394053310263233109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL931855423965869091.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((p7_5>=1)||(p7_2>=1))||((p7_1>=1)||(p7_4>=1)))||((p7_3>=1)||(p7_0>=1)))"))&&("((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((...19399
Formula 0 simplified : XG(!"((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((lc0_70>=1)&&(cl1_70_4>=1)))||(((lc0_27>=1)&&(cl1_27_2>=1))||((lc0_3>=1)&&(cl1_3_1>=1)...19391
Detected timeout of ITS tools.
[2024-05-26 05:59:22] [INFO ] Flatten gal took : 181 ms
[2024-05-26 05:59:22] [INFO ] Applying decomposition
[2024-05-26 05:59:22] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16682520686830613073.txt' '-o' '/tmp/graph16682520686830613073.bin' '-w' '/tmp/graph16682520686830613073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16682520686830613073.bin' '-l' '-1' '-v' '-w' '/tmp/graph16682520686830613073.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:59:22] [INFO ] Decomposing Gal with order
[2024-05-26 05:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 05:59:22] [INFO ] Removed a total of 1614 redundant transitions.
[2024-05-26 05:59:22] [INFO ] Flatten gal took : 117 ms
[2024-05-26 05:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 523 labels/synchronizations in 32 ms.
[2024-05-26 05:59:23] [INFO ] Time to serialize gal into /tmp/LTL4500698050480248303.gal : 16 ms
[2024-05-26 05:59:23] [INFO ] Time to serialize properties into /tmp/LTL3171940297594996943.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4500698050480248303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3171940297594996943.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((i0.u712.p7_5>=1)||(i0.u708.p7_2>=1))||((i0.u707.p7_1>=1)||(i0.u710.p7_4>=1)))||((i0.u709.p7_3>=1)||(i0.u711.p7_0>=1)))"...29443
Formula 0 simplified : XG(!"((((((((((((i84.u29.lc0_46>=1)&&(i84.u589.cl1_46_3>=1))||((i69.u87.lc0_70>=1)&&(i69.u645.cl1_70_4>=1)))||(((i0.u16.lc0_27>=1)&&...29435
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 finished in 290088 ms.
[2024-05-26 05:59:39] [INFO ] Flatten gal took : 883 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9713027948760627561
[2024-05-26 05:59:39] [INFO ] Too many transitions (36265) to apply POR reductions. Disabling POR matrices.
[2024-05-26 05:59:40] [INFO ] Applying decomposition
[2024-05-26 05:59:40] [INFO ] Built C files in 692ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9713027948760627561
Running compilation step : cd /tmp/ltsmin9713027948760627561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 05:59:41] [INFO ] Flatten gal took : 1224 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15662999786520912720.txt' '-o' '/tmp/graph15662999786520912720.bin' '-w' '/tmp/graph15662999786520912720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15662999786520912720.bin' '-l' '-1' '-v' '-w' '/tmp/graph15662999786520912720.weights' '-q' '0' '-e' '0.001'
[2024-05-26 05:59:44] [INFO ] Decomposing Gal with order
[2024-05-26 06:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 06:11:19] [INFO ] Removed a total of 10230 redundant transitions.
[2024-05-26 06:11:20] [INFO ] Flatten gal took : 1929 ms
[2024-05-26 06:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 544 labels/synchronizations in 445 ms.
[2024-05-26 06:11:21] [INFO ] Time to serialize gal into /tmp/LTLFireability4731569765346201601.gal : 315 ms
[2024-05-26 06:11:21] [INFO ] Time to serialize properties into /tmp/LTLFireability898878170655812331.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4731569765346201601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability898878170655812331.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((((i114.u9701.lc0_46>=1)&&(i114.u9527.cl1_46_3>=1))||((i38.u9059.lc0_70>=1)&&(i38.u9304.cl1_70_4>=1)))||(((i10.u9691...31650
Formula 0 simplified : XG(!"((((((((((((i114.u9701.lc0_46>=1)&&(i114.u9527.cl1_46_3>=1))||((i38.u9059.lc0_70>=1)&&(i38.u9304.cl1_70_4>=1)))||(((i10.u9691.l...31642
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9713027948760627561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9713027948760627561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-26 06:36:38] [INFO ] Flatten gal took : 995 ms
[2024-05-26 06:36:38] [INFO ] Time to serialize gal into /tmp/LTLFireability14052719193142032640.gal : 164 ms
[2024-05-26 06:36:38] [INFO ] Time to serialize properties into /tmp/LTLFireability12151398670198643139.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14052719193142032640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12151398670198643139.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((lc0_70>=1)&&(cl1_70_4>=1)))||(((lc0_27>=1)&&(cl1_27_2>=1))||((lc0_3>=1)&&(cl1_3_1>=...19399
Formula 0 simplified : XG(!"((((((((((((lc0_46>=1)&&(cl1_46_3>=1))||((lc0_70>=1)&&(cl1_70_4>=1)))||(((lc0_27>=1)&&(cl1_27_2>=1))||((lc0_3>=1)&&(cl1_3_1>=1)...19391

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636267000508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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