MCC'2021- Execution of r083-tall-162048876000949

About the Execution of ITS-Tools for FamilyReunion-PT-L00020M0002C001P001G001

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1205.747	108015.00	133793.00	7412.80	FFTFFFTFFF??????	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048876000949.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048876000949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 129K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 838K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 276K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 998K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 49K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:51 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-L00020M0002C001P001G001-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-15

=== Now, execution of the tool begins

BK_START 1620712981616

Running Version 0
[2021-05-11 06:03:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 06:03:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 06:03:05] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-11 06:03:05] [INFO ] Transformed 3271 places.
[2021-05-11 06:03:05] [INFO ] Transformed 2753 transitions.
[2021-05-11 06:03:05] [INFO ] Parsed PT model containing 3271 places and 2753 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-11 06:03:05] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 674 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 310 places :
Implicit places reduction removed 310 places
Iterating post reduction 0 with 386 rules applied. Total rules applied 386 place count 2874 transition count 2753
Discarding 230 places :
Symmetric choice reduction at 1 with 230 rule applications. Total rules 616 place count 2644 transition count 2502
Iterating global reduction 1 with 230 rules applied. Total rules applied 846 place count 2644 transition count 2502
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 1 with 20 rules applied. Total rules applied 866 place count 2624 transition count 2502
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 971 place count 2519 transition count 2357
Iterating global reduction 2 with 105 rules applied. Total rules applied 1076 place count 2519 transition count 2357
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 41 places :
Implicit places reduction removed 41 places
Iterating post reduction 2 with 61 rules applied. Total rules applied 1137 place count 2478 transition count 2337
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1199 place count 2416 transition count 2275
Iterating global reduction 3 with 62 rules applied. Total rules applied 1261 place count 2416 transition count 2275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1263 place count 2414 transition count 2233
Iterating global reduction 3 with 2 rules applied. Total rules applied 1265 place count 2414 transition count 2233
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 21 rules applied. Total rules applied 1286 place count 2393 transition count 2233
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1327 place count 2352 transition count 2192
Iterating global reduction 4 with 41 rules applied. Total rules applied 1368 place count 2352 transition count 2192
Applied a total of 1368 rules in 1307 ms. Remains 2352 /3260 variables (removed 908) and now considering 2192/2753 (removed 561) transitions.
// Phase 1: matrix 2192 rows 2352 cols
[2021-05-11 06:03:07] [INFO ] Computed 306 place invariants in 115 ms
[2021-05-11 06:03:10] [INFO ] Implicit Places using invariants in 3152 ms returned [1332, 1481, 1650, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 2161]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 3181 ms to find 24 implicit places.
// Phase 1: matrix 2192 rows 2328 cols
[2021-05-11 06:03:10] [INFO ] Computed 282 place invariants in 61 ms
[2021-05-11 06:03:11] [INFO ] Dead Transitions using invariants and state equation in 1308 ms returned []
Starting structural reductions, iteration 1 : 2328/3260 places, 2192/2753 transitions.
Applied a total of 0 rules in 79 ms. Remains 2328 /2328 variables (removed 0) and now considering 2192/2192 (removed 0) transitions.
// Phase 1: matrix 2192 rows 2328 cols
[2021-05-11 06:03:11] [INFO ] Computed 282 place invariants in 58 ms
[2021-05-11 06:03:13] [INFO ] Dead Transitions using invariants and state equation in 1335 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2328/3260 places, 2192/2753 transitions.
[2021-05-11 06:03:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-11 06:03:13] [INFO ] Flatten gal took : 180 ms
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 06:03:13] [INFO ] Flatten gal took : 104 ms
[2021-05-11 06:03:13] [INFO ] Input system was already deterministic with 2192 transitions.
Finished random walk after 10839 steps, including 8 resets, run visited all 32 properties in 124 ms. (steps per millisecond=87 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F((p1||X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 168 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 175 place count 2153 transition count 2065
Iterating global reduction 1 with 107 rules applied. Total rules applied 282 place count 2153 transition count 2065
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 368 place count 2067 transition count 1979
Iterating global reduction 1 with 86 rules applied. Total rules applied 454 place count 2067 transition count 1979
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 498 place count 2045 transition count 1957
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 542 place count 2001 transition count 1893
Iterating global reduction 2 with 44 rules applied. Total rules applied 586 place count 2001 transition count 1893
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 607 place count 1980 transition count 1893
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 649 place count 1938 transition count 1851
Iterating global reduction 3 with 42 rules applied. Total rules applied 691 place count 1938 transition count 1851
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 733 place count 1896 transition count 1809
Iterating global reduction 3 with 42 rules applied. Total rules applied 775 place count 1896 transition count 1809
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 817 place count 1854 transition count 1767
Iterating global reduction 3 with 42 rules applied. Total rules applied 859 place count 1854 transition count 1767
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 901 place count 1812 transition count 1725
Iterating global reduction 3 with 42 rules applied. Total rules applied 943 place count 1812 transition count 1725
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 985 place count 1770 transition count 1683
Iterating global reduction 3 with 42 rules applied. Total rules applied 1027 place count 1770 transition count 1683
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1069 place count 1728 transition count 1641
Iterating global reduction 3 with 42 rules applied. Total rules applied 1111 place count 1728 transition count 1641
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1153 place count 1686 transition count 1599
Iterating global reduction 3 with 42 rules applied. Total rules applied 1195 place count 1686 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1196 place count 1685 transition count 1598
Iterating global reduction 3 with 1 rules applied. Total rules applied 1197 place count 1685 transition count 1598
Applied a total of 1197 rules in 1336 ms. Remains 1685 /2328 variables (removed 643) and now considering 1598/2192 (removed 594) transitions.
// Phase 1: matrix 1598 rows 1685 cols
[2021-05-11 06:03:16] [INFO ] Computed 171 place invariants in 22 ms
[2021-05-11 06:03:17] [INFO ] Implicit Places using invariants in 340 ms returned [378, 1222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 342 ms to find 2 implicit places.
// Phase 1: matrix 1598 rows 1683 cols
[2021-05-11 06:03:17] [INFO ] Computed 169 place invariants in 11 ms
[2021-05-11 06:03:18] [INFO ] Dead Transitions using invariants and state equation in 849 ms returned []
Starting structural reductions, iteration 1 : 1683/2328 places, 1598/2192 transitions.
Applied a total of 0 rules in 102 ms. Remains 1683 /1683 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
// Phase 1: matrix 1598 rows 1683 cols
[2021-05-11 06:03:18] [INFO ] Computed 169 place invariants in 11 ms
[2021-05-11 06:03:18] [INFO ] Dead Transitions using invariants and state equation in 778 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1683/2328 places, 1598/2192 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s155 1) (LT s302 1)) (OR (LT s160 1) (LT s307 1)) (OR (LT s151 1) (LT s256 1)) (OR (LT s150 1) (LT s297 1)) (OR (LT s147 1) (LT s273 1)) (OR (LT s149 1) (LT s275 1)) (OR (LT s159 1) (LT s285 1)) (OR (LT s163 1) (LT s268 1)) (OR (LT s156 1) (LT s261 1)) (OR (LT s148 1) (LT s253 1)) (OR (LT s154 1) (LT s280 1)) (OR (LT s165 1) (LT s312 1)) (OR (LT s153 1) (LT s300 1)) (OR (LT s157 1) (LT s304 1)) (OR (LT s162 1) (LT s288 1)) (OR (LT s166 1) (LT s292 1)) (OR (LT s164 1) (LT s269 1)) (OR (LT s162 1) (LT s309 1)) (OR (LT s148 1) (LT s295 1)) (OR (LT s155 1) (LT s281 1)) (OR (LT s157 1) (LT s283 1)) (OR (LT s151 1) (LT s298 1)) (OR (LT s152 1) (LT s278 1)) (OR (LT s158 1) (LT s263 1)) (OR (LT s166 1) (LT s271 1)) (OR (LT s167 1) (LT s314 1)) (OR (LT s159 1) (LT s306 1)) (OR (LT s161 1) (LT s266 1)) (OR (LT s150 1) (LT s255 1)) (OR (LT s153 1) (LT s258 1)) (OR (LT s160 1) (LT s286 1)) (OR (LT s148 1) (LT s274 1)) (OR (LT s162 1) (LT s267 1)) (OR (LT s167 1) (LT s272 1)) (OR (LT s152 1) (LT s257 1)) (OR (LT s157 1) (LT s262 1)) (OR (LT s166 1) (LT s313 1)) (OR (LT s154 1) (LT s301 1)) (OR (LT s153 1) (LT s279 1)) (OR (LT s163 1) (LT s289 1)) (OR (LT s165 1) (LT s291 1)) (OR (LT s164 1) (LT s311 1)) (OR (LT s156 1) (LT s303 1)) (OR (LT s155 1) (LT s260 1)) (OR (LT s147 1) (LT s252 1)) (OR (LT s149 1) (LT s296 1)) (OR (LT s150 1) (LT s276 1)) (OR (LT s161 1) (LT s308 1)) (OR (LT s158 1) (LT s284 1)) (OR (LT s147 1) (LT s294 1)) (OR (LT s163 1) (LT s310 1)) (OR (LT s152 1) (LT s299 1)) (OR (LT s159 1) (LT s264 1)) (OR (LT s165 1) (LT s270 1)) (OR (LT s149 1) (LT s254 1)) (OR (LT s154 1) (LT s259 1)) (OR (LT s160 1) (LT s265 1)) (OR (LT s158 1) (LT s305 1)) (OR (LT s151 1) (LT s277 1)) (OR (LT s161 1) (LT s287 1)) (OR (LT s167 1) (LT s293 1)) (OR (LT s156 1) (LT s282 1)) (OR (LT s164 1) (LT s290 1))), p1:(AND (LT s97 1) (LT s96 1) (LT s99 1) (LT s98 1) (LT s101 1) (LT s100 1) (LT s103 1) (LT s102 1) (LT s104 1) (LT s85 1) (LT s84 1) (LT s87 1) (LT s86 1) (LT s89 1) (LT s88 1) (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s95 1) (LT s94 1)), p3:(AND (OR (LT s800 1) (LT s926 1)) (OR (LT s816 1) (LT s942 1)) (OR (LT s805 1) (LT s931 1)) (OR (LT s811 1) (LT s937 1)) (OR (LT s814 1) (LT s919 1)) (OR (LT s804 1) (LT s909 1)) (OR (LT s808 1) (LT s913 1)) (OR (LT s810 1) (LT s915 1)) (OR (LT s804 1) (LT s930 1)) (OR (LT s812 1) (LT s938 1)) (OR (LT s799 1) (LT s925 1)) (OR (LT s807 1) (LT s933 1)) (OR (LT s815 1) (LT s941 1)) (OR (LT s813 1) (LT s918 1)) (OR (LT s817 1) (LT s922 1)) (OR (LT s805 1) (LT s910 1)) (OR (LT s809 1) (LT s914 1)) (OR (LT s801 1) (LT s906 1)) (OR (LT s808 1) (LT s934 1)) (OR (LT s803 1) (LT s929 1)) (OR (LT s813 1) (LT s939 1)) (OR (LT s818 1) (LT s944 1)) (OR (LT s819 1) (LT s945 1)) (OR (LT s800 1) (LT s905 1)) (OR (LT s812 1) (LT s917 1)) (OR (LT s816 1) (LT s921 1)) (OR (LT s818 1) (LT s923 1)) (OR (LT s802 1) (LT s907 1)) (OR (LT s806 1) (LT s911 1)) (OR (LT s801 1) (LT s927 1)) (OR (LT s809 1) (LT s935 1)) (OR (LT s817 1) (LT s943 1)) (OR (LT s799 1) (LT s904 1)) (OR (LT s802 1) (LT s928 1)) (OR (LT s806 1) (LT s932 1)) (OR (LT s810 1) (LT s936 1)) (OR (LT s814 1) (LT s940 1)) (OR (LT s815 1) (LT s920 1)) (OR (LT s819 1) (LT s924 1)) (OR (LT s803 1) (LT s908 1)) (OR (LT s807 1) (LT s912 1)) (OR (LT s811 1) (LT s916 1)) (LT s97 1) (LT s96 1) (LT s99 1) (LT s98 1) (LT s101 1) (LT s100 1) (LT s103 1) (LT s102 1) (LT s104 1) (LT s85 1) (LT s84 1) (LT s87 1) (LT s86 1) (LT s89 1) (LT s88 1) (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s95 1) (LT s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-00 finished in 5128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 84 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 154 place count 2174 transition count 2086
Iterating global reduction 1 with 86 rules applied. Total rules applied 240 place count 2174 transition count 2086
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 305 place count 2109 transition count 2021
Iterating global reduction 1 with 65 rules applied. Total rules applied 370 place count 2109 transition count 2021
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 414 place count 2087 transition count 1999
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 457 place count 2044 transition count 1956
Iterating global reduction 2 with 43 rules applied. Total rules applied 500 place count 2044 transition count 1956
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 542 place count 2002 transition count 1914
Iterating global reduction 2 with 42 rules applied. Total rules applied 584 place count 2002 transition count 1914
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 626 place count 1960 transition count 1872
Iterating global reduction 2 with 42 rules applied. Total rules applied 668 place count 1960 transition count 1872
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 710 place count 1918 transition count 1830
Iterating global reduction 2 with 42 rules applied. Total rules applied 752 place count 1918 transition count 1830
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 794 place count 1876 transition count 1788
Iterating global reduction 2 with 42 rules applied. Total rules applied 836 place count 1876 transition count 1788
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 878 place count 1834 transition count 1746
Iterating global reduction 2 with 42 rules applied. Total rules applied 920 place count 1834 transition count 1746
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 962 place count 1792 transition count 1704
Iterating global reduction 2 with 42 rules applied. Total rules applied 1004 place count 1792 transition count 1704
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1046 place count 1750 transition count 1662
Iterating global reduction 2 with 42 rules applied. Total rules applied 1088 place count 1750 transition count 1662
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1130 place count 1708 transition count 1620
Iterating global reduction 2 with 42 rules applied. Total rules applied 1172 place count 1708 transition count 1620
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1214 place count 1666 transition count 1578
Iterating global reduction 2 with 42 rules applied. Total rules applied 1256 place count 1666 transition count 1578
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 2 with 61 rules applied. Total rules applied 1317 place count 1646 transition count 1537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1318 place count 1645 transition count 1536
Iterating global reduction 3 with 1 rules applied. Total rules applied 1319 place count 1645 transition count 1536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 1321 place count 1644 transition count 1535
Applied a total of 1321 rules in 1468 ms. Remains 1644 /2328 variables (removed 684) and now considering 1535/2192 (removed 657) transitions.
// Phase 1: matrix 1535 rows 1644 cols
[2021-05-11 06:03:20] [INFO ] Computed 171 place invariants in 9 ms
[2021-05-11 06:03:21] [INFO ] Implicit Places using invariants in 367 ms returned [273, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 1181]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 370 ms to find 23 implicit places.
// Phase 1: matrix 1535 rows 1621 cols
[2021-05-11 06:03:21] [INFO ] Computed 148 place invariants in 10 ms
[2021-05-11 06:03:21] [INFO ] Dead Transitions using invariants and state equation in 718 ms returned []
Starting structural reductions, iteration 1 : 1621/2328 places, 1535/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1580 transition count 1494
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1580 transition count 1494
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1560 transition count 1454
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1560 transition count 1454
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1540 transition count 1434
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1540 transition count 1434
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1520 transition count 1414
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1520 transition count 1414
Applied a total of 202 rules in 376 ms. Remains 1520 /1621 variables (removed 101) and now considering 1414/1535 (removed 121) transitions.
// Phase 1: matrix 1414 rows 1520 cols
[2021-05-11 06:03:22] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-11 06:03:22] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1414 rows 1520 cols
[2021-05-11 06:03:22] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-11 06:03:23] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1520/2328 places, 1414/2192 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s457 1) (GEQ s478 1)) (AND (GEQ s452 1) (GEQ s473 1)) (AND (GEQ s446 1) (GEQ s467 1)) (AND (GEQ s441 1) (GEQ s462 1)) (AND (GEQ s459 1) (GEQ s501 1)) (AND (GEQ s443 1) (GEQ s485 1)) (AND (GEQ s447 1) (GEQ s489 1)) (AND (GEQ s449 1) (GEQ s491 1)) (AND (GEQ s453 1) (GEQ s495 1)) (AND (GEQ s453 1) (GEQ s474 1)) (AND (GEQ s460 1) (GEQ s502 1)) (AND (GEQ s445 1) (GEQ s466 1)) (AND (GEQ s461 1) (GEQ s482 1)) (AND (GEQ s458 1) (GEQ s479 1)) (AND (GEQ s442 1) (GEQ s463 1)) (AND (GEQ s450 1) (GEQ s471 1)) (AND (GEQ s444 1) (GEQ s486 1)) (AND (GEQ s448 1) (GEQ s490 1)) (AND (GEQ s452 1) (GEQ s494 1)) (AND (GEQ s456 1) (GEQ s498 1)) (AND (GEQ s449 1) (GEQ s470 1)) (AND (GEQ s454 1) (GEQ s475 1)) (AND (GEQ s460 1) (GEQ s481 1)) (AND (GEQ s444 1) (GEQ s465 1)) (AND (GEQ s461 1) (GEQ s503 1)) (AND (GEQ s441 1) (GEQ s483 1)) (AND (GEQ s445 1) (GEQ s487 1)) (AND (GEQ s451 1) (GEQ s493 1)) (AND (GEQ s455 1) (GEQ s497 1)) (AND (GEQ s457 1) (GEQ s499 1)) (AND (GEQ s456 1) (GEQ s477 1)) (AND (GEQ s448 1) (GEQ s469 1)) (AND (GEQ s455 1) (GEQ s476 1)) (AND (GEQ s459 1) (GEQ s480 1)) (AND (GEQ s458 1) (GEQ s500 1)) (AND (GEQ s443 1) (GEQ s464 1)) (AND (GEQ s447 1) (GEQ s468 1)) (AND (GEQ s451 1) (GEQ s472 1)) (AND (GEQ s442 1) (GEQ s484 1)) (AND (GEQ s446 1) (GEQ s488 1)) (AND (GEQ s450 1) (GEQ s492 1)) (AND (GEQ s454 1) (GEQ s496 1))), p1:(OR (GEQ s273 1) (GEQ s274 1) (GEQ s275 1) (GEQ s276 1) (GEQ s277 1) (GEQ s278 1) (GEQ s279 1) (GEQ s288 1) (GEQ s289 1) (GEQ s290 1) (GEQ s291 1) (GEQ s292 1) (GEQ s293 1) (GEQ s280 1) (GEQ s281 1) (GEQ s282 1) (GEQ s283 1) (GEQ s284 1) (GEQ s285 1) (GEQ s286 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-01 finished in 4522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G((F(p1)&&p0))||(F(p1)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 105 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Drop transitions removed 1173 transitions
Trivial Post-agglo rules discarded 1173 transitions
Performed 1173 trivial Post agglomeration. Transition count delta: 1173
Iterating post reduction 0 with 1241 rules applied. Total rules applied 1241 place count 2259 transition count 1018
Reduce places removed 1173 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 1193 rules applied. Total rules applied 2434 place count 1086 transition count 998
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2454 place count 1066 transition count 998
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 2454 place count 1066 transition count 764
Deduced a syphon composed of 234 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 573 rules applied. Total rules applied 3027 place count 727 transition count 764
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 21 rules applied. Total rules applied 3048 place count 727 transition count 743
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 3069 place count 706 transition count 743
Discarding 86 places :
Symmetric choice reduction at 5 with 86 rule applications. Total rules 3155 place count 620 transition count 637
Iterating global reduction 5 with 86 rules applied. Total rules applied 3241 place count 620 transition count 637
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 41 places :
Implicit places reduction removed 41 places
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 5 with 208 rules applied. Total rules applied 3449 place count 579 transition count 470
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 105 rules applied. Total rules applied 3554 place count 475 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3555 place count 474 transition count 469
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3555 place count 474 transition count 448
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 43 rules applied. Total rules applied 3598 place count 452 transition count 448
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3599 place count 451 transition count 447
Iterating global reduction 8 with 1 rules applied. Total rules applied 3600 place count 451 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 3604 place count 450 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3606 place count 448 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3606 place count 448 transition count 443
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3608 place count 447 transition count 443
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 10 with 212 rules applied. Total rules applied 3820 place count 341 transition count 337
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3841 place count 320 transition count 316
Ensure Unique test removed 21 places
Iterating global reduction 10 with 42 rules applied. Total rules applied 3883 place count 299 transition count 316
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 10 with 42 rules applied. Total rules applied 3925 place count 299 transition count 274
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 3946 place count 278 transition count 274
Applied a total of 3946 rules in 267 ms. Remains 278 /2328 variables (removed 2050) and now considering 274/2192 (removed 1918) transitions.
// Phase 1: matrix 274 rows 278 cols
[2021-05-11 06:03:23] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-11 06:03:24] [INFO ] Implicit Places using invariants in 121 ms returned [21, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 192]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 123 ms to find 44 implicit places.
[2021-05-11 06:03:24] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 274 rows 234 cols
[2021-05-11 06:03:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-11 06:03:24] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 234/2328 places, 274/2192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 233 transition count 273
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2 place count 233 transition count 252
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 44 place count 212 transition count 252
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 192 transition count 232
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 192 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 191 transition count 231
Applied a total of 86 rules in 13 ms. Remains 191 /234 variables (removed 43) and now considering 231/274 (removed 43) transitions.
// Phase 1: matrix 231 rows 191 cols
[2021-05-11 06:03:24] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-11 06:03:24] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 231 rows 191 cols
[2021-05-11 06:03:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-11 06:03:24] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 191/2328 places, 231/2192 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s148 1) (LT s160 1) (LT s159 1) (LT s158 1) (LT s157 1) (LT s164 1) (LT s163 1) (LT s162 1) (LT s161 1) (LT s152 1) (LT s151 1) (LT s150 1) (LT s149 1) (LT s156 1) (LT s155 1) (LT s154 1) (LT s153 1) (LT s176 1) (LT s175 1) (LT s174 1) (LT s173 1) (LT s180 1) (LT s179 1) (LT s178 1) (LT s177 1) (LT s168 1) (LT s167 1) (LT s166 1) (LT s165 1) (LT s172 1) (LT s171 1) (LT s170 1) (LT s169 1) (LT s189 1) (LT s184 1) (LT s183 1) (LT s182 1) (LT s181 1) (LT s188 1) (LT s187 1) (LT s186 1) (LT s185 1)), p1:(AND (LT s81 1) (LT s82 1) (LT s83 1) (LT s84 1) (LT s73 1) (LT s74 1) (LT s75 1) (LT s76 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s80 1) (LT s65 1) (LT s66 1) (LT s67 1) (LT s61 1) (LT s68 1) (LT s60 1) (LT s69 1) (LT s59 1) (LT s70 1) (LT s58 1) (LT s71 1) (LT s57 1) (LT s72 1) (LT s62 1) (LT s63 1) (LT s64 1) (LT s48 1) (LT s47 1) (LT s46 1) (LT s45 1) (LT s44 1) (LT s43 1) (LT s56 1) (LT s55 1) (LT s54 1) (LT s53 1) (LT s52 1) (LT s51 1) (LT s50 1) (LT s49 1)), p2:(AND (LT s105 1) (LT s104 1) (LT s103 1) (LT s102 1) (LT s101 1) (LT s100 1) (LT s99 1) (LT s98 1) (LT s97 1) (LT s96 1) (LT s95 1) (LT s94 1) (LT s93 1) (LT s92 1) (LT s91 1) (LT s90 1) (LT s89 1) (LT s88 1) (LT s87 1) (LT s86 1) (LT s85 1) (LT s148 1) (LT s160 1) (LT s159 1) (LT s158 1) (LT s157 1) (LT s164 1) (LT s163 1) (LT s162 1) (LT s161 1) (LT s152 1) (LT s151 1) (LT s150 1) (LT s149 1) (LT s156 1) (LT s155 1) (LT s154 1) (LT s153 1) (LT s176 1) (LT s175 1) (LT s174 1) (LT s173 1) (LT s180 1) (LT s179 1) (LT s178 1) (LT s177 1) (LT s168 1) (LT s167 1) (LT s166 1) (LT s165 1) (LT s172 1) (LT s171 1) (LT s170 1) (LT s169 1) (LT s189 1) (LT s184 1) (LT s183 1) (LT s182 1) (LT s181 1) (LT s188 1) (LT s187 1) (LT s186 1) (LT s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1208 reset in 563 ms.
Product exploration explored 100000 steps with 1202 reset in 500 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 191 transition count 231
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 : [(F (G p0)), (F (G p1)), (F (G p2)), p0, p1, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G p0))
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-02 finished in 3244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 189 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2323 transition count 2192
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 50 place count 2278 transition count 2127
Iterating global reduction 1 with 45 rules applied. Total rules applied 95 place count 2278 transition count 2127
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 118 place count 2255 transition count 2104
Iterating global reduction 1 with 23 rules applied. Total rules applied 141 place count 2255 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 143 place count 2254 transition count 2103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 2252 transition count 2081
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 2252 transition count 2081
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 168 place count 2231 transition count 2081
Applied a total of 168 rules in 546 ms. Remains 2231 /2328 variables (removed 97) and now considering 2081/2192 (removed 111) transitions.
// Phase 1: matrix 2081 rows 2231 cols
[2021-05-11 06:03:27] [INFO ] Computed 255 place invariants in 24 ms
[2021-05-11 06:03:28] [INFO ] Implicit Places using invariants in 615 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 483, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1768]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 625 ms to find 44 implicit places.
// Phase 1: matrix 2081 rows 2187 cols
[2021-05-11 06:03:28] [INFO ] Computed 211 place invariants in 15 ms
[2021-05-11 06:03:29] [INFO ] Dead Transitions using invariants and state equation in 1108 ms returned []
Starting structural reductions, iteration 1 : 2187/2328 places, 2081/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2146 transition count 2040
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2146 transition count 2040
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2126 transition count 2000
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2126 transition count 2000
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2106 transition count 1980
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2106 transition count 1980
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2086 transition count 1960
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2086 transition count 1960
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2066 transition count 1940
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2066 transition count 1940
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2046 transition count 1920
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2046 transition count 1920
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 2026 transition count 1900
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 2026 transition count 1900
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 2006 transition count 1880
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 2006 transition count 1880
Applied a total of 362 rules in 1054 ms. Remains 2006 /2187 variables (removed 181) and now considering 1880/2081 (removed 201) transitions.
// Phase 1: matrix 1880 rows 2006 cols
[2021-05-11 06:03:30] [INFO ] Computed 211 place invariants in 10 ms
[2021-05-11 06:03:30] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 1880 rows 2006 cols
[2021-05-11 06:03:30] [INFO ] Computed 211 place invariants in 17 ms
[2021-05-11 06:03:31] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2006/2328 places, 1880/2192 transitions.
Stuttering acceptance computed with spot in 2851 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1057 1) (LT s1185 1)) (OR (LT s1052 1) (LT s1180 1)) (OR (LT s1062 1) (LT s1190 1)) (OR (LT s1067 1) (LT s1195 1)) (OR (LT s1047 1) (LT s1175 1)) (OR (LT s1025 1) (LT s1153 1)) (OR (LT s1035 1) (LT s1163 1)) (OR (LT s1037 1) (LT s1165 1)) (OR (LT s1015 1) (LT s1143 1)) (OR (LT s1069 1) (LT s1197 1)) (OR (LT s1045 1) (LT s1173 1)) (OR (LT s1074 1) (LT s1202 1)) (OR (LT s1022 1) (LT s1150 1)) (OR (LT s1030 1) (LT s1158 1)) (OR (LT s1042 1) (LT s1170 1)) (OR (LT s1054 1) (LT s1182 1)) (OR (LT s1050 1) (LT s1178 1)) (OR (LT s1018 1) (LT s1146 1)) (OR (LT s1070 1) (LT s1198 1)) (OR (LT s1059 1) (LT s1187 1)) (OR (LT s1043 1) (LT s1171 1)) (OR (LT s1027 1) (LT s1155 1)) (OR (LT s1029 1) (LT s1157 1)) (OR (LT s1013 1) (LT s1141 1)) (OR (LT s1024 1) (LT s1152 1)) (OR (LT s1032 1) (LT s1160 1)) (OR (LT s1040 1) (LT s1168 1)) (OR (LT s1048 1) (LT s1176 1)) (OR (LT s1056 1) (LT s1184 1)) (OR (LT s1064 1) (LT s1192 1)) (OR (LT s1072 1) (LT s1200 1)) (OR (LT s1016 1) (LT s1144 1)) (OR (LT s1036 1) (LT s1164 1)) (OR (LT s1073 1) (LT s1201 1)) (OR (LT s1041 1) (LT s1169 1)) (OR (LT s1068 1) (LT s1196 1)) (OR (LT s1063 1) (LT s1191 1)) (OR (LT s1051 1) (LT s1179 1)) (OR (LT s1021 1) (LT s1149 1)) (OR (LT s1031 1) (LT s1159 1)) (OR (LT s1019 1) (LT s1147 1)) (OR (LT s1061 1) (LT s1189 1)) (OR (LT s1053 1) (LT s1181 1)) (OR (LT s1066 1) (LT s1194 1)) (OR (LT s1026 1) (LT s1154 1)) (OR (LT s1034 1) (LT s1162 1)) (OR (LT s1038 1) (LT s1166 1)) (OR (LT s1046 1) (LT s1174 1)) (OR (LT s1058 1) (LT s1186 1)) (OR (LT s1014 1) (LT s1142 1)) (OR (LT s1065 1) (LT s1193 1)) (OR (LT s1028 1) (LT s1156 1)) (OR (LT s1044 1) (LT s1172 1)) (OR (LT s1049 1) (LT s1177 1)) (OR (LT s1060 1) (LT s1188 1)) (OR (LT s1071 1) (LT s1199 1)) (OR (LT s1055 1) (LT s1183 1)) (OR (LT s1023 1) (LT s1151 1)) (OR (LT s1033 1) (LT s1161 1)) (OR (LT s1039 1) (LT s1167 1)) (OR (LT s1017 1) (LT s1145 1)) (OR (LT s1012 1) (LT s1140 1)) (OR (LT s1020 1) (LT s1148 1)) (OR (AND (GEQ s224 1) (GEQ s434 1)) (AND (GEQ s210 1) (GEQ s441 1)) (AND (GEQ s215 1) (GEQ s446 1)) (AND (GEQ s219 1) (GEQ s429 1)) (AND (GEQ s213 1) (GEQ s423 1)) (AND (GEQ s229 1) (GEQ s439 1)) (AND (GEQ s225 1) (GEQ s456 1)) (AND (GEQ s221 1) (GEQ s452 1)) (AND (GEQ s217 1) (GEQ s427 1)) (AND (GEQ s225 1) (GEQ s435 1)) (AND (GEQ s230 1) (GEQ s440 1)) (AND (GEQ s218 1) (GEQ s428 1)) (AND (GEQ s222 1) (GEQ s432 1)) (AND (GEQ s226 1) (GEQ s436 1)) (AND (GEQ s210 1) (GEQ s420 1)) (AND (GEQ s214 1) (GEQ s424 1)) (AND (GEQ s212 1) (GEQ s443 1)) (AND (GEQ s216 1) (GEQ s447 1)) (AND (GEQ s220 1) (GEQ s451 1)) (AND (GEQ s224 1) (GEQ s455 1)) (AND (GEQ s228 1) (GEQ s459 1)) (AND (GEQ s216 1) (GEQ s426 1)) (AND (GEQ s218 1) (GEQ s449 1)) (AND (GEQ s223 1) (GEQ s454 1)) (AND (GEQ s221 1) (GEQ s431 1)) (AND (GEQ s211 1) (GEQ s421 1)) (AND (GEQ s227 1) (GEQ s437 1)) (AND (GEQ s229 1) (GEQ s460 1)) (AND (GEQ s213 1) (GEQ s444 1)) (AND (GEQ s217 1) (GEQ s448 1)) (AND (GEQ s220 1) (GEQ s430 1)) (AND (GEQ s227 1) (GEQ s458 1)) (AND (GEQ s212 1) (GEQ s422 1)) (AND (GEQ s211 1) (GEQ s442 1)) (AND (GEQ s214 1) (GEQ s445 1)) (AND (GEQ s219 1) (GEQ s450 1)) (AND (GEQ s222 1) (GEQ s453 1)) (AND (GEQ s223 1) (GEQ s433 1)) (AND (GEQ s215 1) (GEQ s425 1)) (AND (GEQ s228 1) (GEQ s438 1)) (AND (GEQ s226 1) (GEQ s457 1)) (AND (GEQ s230 1) (GEQ s461 1)))), p0:(OR (AND (GEQ s224 1) (GEQ s434 1)) (AND (GEQ s210 1) (GEQ s441 1)) (AND (GEQ s215 1) (GEQ s446 1)) (AND (GEQ s219 1) (GEQ s429 1)) (AND (GEQ s213 1) (GEQ s423 1)) (AND (GEQ s229 1) (GEQ s439 1)) (AND (GEQ s225 1) (GEQ s456 1)) (AND (GEQ s221 1) (GEQ s452 1)) (AND (GEQ s217 1) (GEQ s427 1)) (AND (GEQ s225 1) (GEQ s435 1)) (AND (GEQ s230 1) (GEQ s440 1)) (AND (GEQ s218 1) (GEQ s428 1)) (AND (GEQ s222 1) (GEQ s432 1)) (AND (GEQ s226 1) (GEQ s436 1)) (AND (GEQ s210 1) (GEQ s420 1)) (AND (GEQ s214 1) (GEQ s424 1)) (AND (GEQ s212 1) (GEQ s443 1)) (AND (GEQ s216 1) (GEQ s447 1)) (AND (GEQ s220 1) (GEQ s451 1)) (AND (GEQ s224 1) (GEQ s455 1)) (AND (GEQ s228 1) (GEQ s459 1)) (AND (GEQ s216 1) (GEQ s426 1)) (AND (GEQ s218 1) (GEQ s449 1)) (AND (GEQ s223 1) (GEQ s454 1)) (AND (GEQ s221 1) (GEQ s431 1)) (AND (GEQ s211 1) (GEQ s421 1)) (AND (GEQ s227 1) (GEQ s437 1)) (AND (GEQ s229 1) (GEQ s460 1)) (AND (GEQ s213 1) (GEQ s444 1)) (AND (GEQ s217 1) (GEQ s448 1)) (AND (GEQ s220 1) (GEQ s430 1)) (AND (GEQ s227 1) (GEQ s458 1)) (AND (GEQ s212 1) (GEQ s422 1)) (AND (GEQ s211 1) (GEQ s442 1)) (AND (GEQ s214 1) (GEQ s445 1)) (AND (GEQ s219 1) (GEQ s450 1)) (AND (GEQ s222 1) (GEQ s453 1)) (AND (GEQ s223 1) (GEQ s433 1)) (AND (GEQ s215 1) (GEQ s425 1)) (AND (GEQ s228 1) (GEQ s438 1)) (AND (GEQ s226 1) (GEQ s457 1)) (AND (GEQ s230 1) (GEQ s461 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-04 finished in 7659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 84 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 175 place count 2153 transition count 2065
Iterating global reduction 1 with 107 rules applied. Total rules applied 282 place count 2153 transition count 2065
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 368 place count 2067 transition count 1979
Iterating global reduction 1 with 86 rules applied. Total rules applied 454 place count 2067 transition count 1979
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 498 place count 2045 transition count 1957
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 542 place count 2001 transition count 1893
Iterating global reduction 2 with 44 rules applied. Total rules applied 586 place count 2001 transition count 1893
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 607 place count 1980 transition count 1893
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 649 place count 1938 transition count 1851
Iterating global reduction 3 with 42 rules applied. Total rules applied 691 place count 1938 transition count 1851
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 733 place count 1896 transition count 1809
Iterating global reduction 3 with 42 rules applied. Total rules applied 775 place count 1896 transition count 1809
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 817 place count 1854 transition count 1767
Iterating global reduction 3 with 42 rules applied. Total rules applied 859 place count 1854 transition count 1767
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 901 place count 1812 transition count 1725
Iterating global reduction 3 with 42 rules applied. Total rules applied 943 place count 1812 transition count 1725
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 985 place count 1770 transition count 1683
Iterating global reduction 3 with 42 rules applied. Total rules applied 1027 place count 1770 transition count 1683
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1069 place count 1728 transition count 1641
Iterating global reduction 3 with 42 rules applied. Total rules applied 1111 place count 1728 transition count 1641
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1153 place count 1686 transition count 1599
Iterating global reduction 3 with 42 rules applied. Total rules applied 1195 place count 1686 transition count 1599
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1237 place count 1644 transition count 1557
Iterating global reduction 3 with 42 rules applied. Total rules applied 1279 place count 1644 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1280 place count 1643 transition count 1556
Iterating global reduction 3 with 1 rules applied. Total rules applied 1281 place count 1643 transition count 1556
Applied a total of 1281 rules in 1341 ms. Remains 1643 /2328 variables (removed 685) and now considering 1556/2192 (removed 636) transitions.
// Phase 1: matrix 1556 rows 1643 cols
[2021-05-11 06:03:35] [INFO ] Computed 171 place invariants in 9 ms
[2021-05-11 06:03:36] [INFO ] Implicit Places using invariants in 446 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 336, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 1180]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 448 ms to find 44 implicit places.
// Phase 1: matrix 1556 rows 1599 cols
[2021-05-11 06:03:36] [INFO ] Computed 127 place invariants in 8 ms
[2021-05-11 06:03:37] [INFO ] Dead Transitions using invariants and state equation in 802 ms returned []
Starting structural reductions, iteration 1 : 1599/2328 places, 1556/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1558 transition count 1515
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1558 transition count 1515
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1538 transition count 1475
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1538 transition count 1475
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1518 transition count 1455
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1518 transition count 1455
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1498 transition count 1435
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1498 transition count 1435
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1478 transition count 1415
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1478 transition count 1415
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1458 transition count 1395
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1458 transition count 1395
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1438 transition count 1375
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1438 transition count 1375
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1418 transition count 1355
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1418 transition count 1355
Applied a total of 362 rules in 628 ms. Remains 1418 /1599 variables (removed 181) and now considering 1355/1556 (removed 201) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2021-05-11 06:03:37] [INFO ] Computed 127 place invariants in 6 ms
[2021-05-11 06:03:38] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1355 rows 1418 cols
[2021-05-11 06:03:38] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-11 06:03:39] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1418/2328 places, 1355/2192 transitions.
Stuttering acceptance computed with spot in 1325 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s736 1) (GEQ s735 1) (GEQ s734 1) (GEQ s733 1) (GEQ s732 1) (GEQ s731 1) (GEQ s730 1) (GEQ s729 1) (GEQ s728 1) (GEQ s727 1) (GEQ s726 1) (GEQ s725 1) (GEQ s724 1) (GEQ s744 1) (GEQ s743 1) (GEQ s742 1) (GEQ s741 1) (GEQ s740 1) (GEQ s739 1) (GEQ s738 1) (GEQ s737 1)), p1:(OR (GEQ s170 1) (GEQ s168 1) (GEQ s174 1) (GEQ s172 1) (GEQ s178 1) (GEQ s176 1) (GEQ s182 1) (GEQ s180 1) (GEQ s186 1) (GEQ s184 1) (GEQ s190 1) (GEQ s188 1) (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s147 1) (GEQ s208 1) (GEQ s151 1) (GEQ s149 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ s167 1) (GEQ s165 1) (GEQ s171 1) (GEQ s169 1) (GEQ s175 1) (GEQ s173 1) (GEQ s179 1) (GEQ s177 1) (GEQ s183 1) (GEQ s181 1) (GEQ s187 1) (GEQ s185 1) (GEQ s191 1) (GEQ s189 1) (GEQ s195 1) (GEQ s193 1) (GEQ s199 1) (GEQ s197 1) (GEQ s203 1) (GEQ s201 1) (GEQ s207 1) (GEQ s205 1) (GEQ s209 1) (GEQ s150 1) (GEQ s148 1) (GEQ s154 1) (GEQ s152 1) (GEQ s158 1) (GEQ s156 1) (GEQ s162 1) (GEQ s160 1) (GEQ s166 1) (GEQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-05 finished in 5845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 42 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 155 place count 2173 transition count 2085
Iterating global reduction 1 with 87 rules applied. Total rules applied 242 place count 2173 transition count 2085
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 328 place count 2087 transition count 1999
Iterating global reduction 1 with 86 rules applied. Total rules applied 414 place count 2087 transition count 1999
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 458 place count 2065 transition count 1977
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 501 place count 2022 transition count 1914
Iterating global reduction 2 with 43 rules applied. Total rules applied 544 place count 2022 transition count 1914
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 565 place count 2001 transition count 1914
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 607 place count 1959 transition count 1872
Iterating global reduction 3 with 42 rules applied. Total rules applied 649 place count 1959 transition count 1872
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 691 place count 1917 transition count 1830
Iterating global reduction 3 with 42 rules applied. Total rules applied 733 place count 1917 transition count 1830
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 775 place count 1875 transition count 1788
Iterating global reduction 3 with 42 rules applied. Total rules applied 817 place count 1875 transition count 1788
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 859 place count 1833 transition count 1746
Iterating global reduction 3 with 42 rules applied. Total rules applied 901 place count 1833 transition count 1746
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 943 place count 1791 transition count 1704
Iterating global reduction 3 with 42 rules applied. Total rules applied 985 place count 1791 transition count 1704
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1027 place count 1749 transition count 1662
Iterating global reduction 3 with 42 rules applied. Total rules applied 1069 place count 1749 transition count 1662
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1111 place count 1707 transition count 1620
Iterating global reduction 3 with 42 rules applied. Total rules applied 1153 place count 1707 transition count 1620
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1195 place count 1665 transition count 1578
Iterating global reduction 3 with 42 rules applied. Total rules applied 1237 place count 1665 transition count 1578
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1279 place count 1623 transition count 1536
Iterating global reduction 3 with 42 rules applied. Total rules applied 1321 place count 1623 transition count 1536
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 3 with 61 rules applied. Total rules applied 1382 place count 1603 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1383 place count 1602 transition count 1494
Iterating global reduction 4 with 1 rules applied. Total rules applied 1384 place count 1602 transition count 1494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1386 place count 1601 transition count 1493
Applied a total of 1386 rules in 1435 ms. Remains 1601 /2328 variables (removed 727) and now considering 1493/2192 (removed 699) transitions.
// Phase 1: matrix 1493 rows 1601 cols
[2021-05-11 06:03:41] [INFO ] Computed 150 place invariants in 8 ms
[2021-05-11 06:03:42] [INFO ] Implicit Places using invariants in 358 ms returned [273, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 1117]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 360 ms to find 23 implicit places.
// Phase 1: matrix 1493 rows 1578 cols
[2021-05-11 06:03:42] [INFO ] Computed 127 place invariants in 8 ms
[2021-05-11 06:03:42] [INFO ] Dead Transitions using invariants and state equation in 676 ms returned []
Starting structural reductions, iteration 1 : 1578/2328 places, 1493/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1537 transition count 1452
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1537 transition count 1452
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1517 transition count 1412
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1517 transition count 1412
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1497 transition count 1392
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1497 transition count 1392
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1477 transition count 1372
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1477 transition count 1372
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1457 transition count 1352
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1457 transition count 1352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1437 transition count 1332
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1437 transition count 1332
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1417 transition count 1312
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1417 transition count 1312
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1397 transition count 1292
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1397 transition count 1292
Applied a total of 362 rules in 629 ms. Remains 1397 /1578 variables (removed 181) and now considering 1292/1493 (removed 201) transitions.
// Phase 1: matrix 1292 rows 1397 cols
[2021-05-11 06:03:43] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-11 06:03:43] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 1292 rows 1397 cols
[2021-05-11 06:03:43] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-11 06:03:44] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1397/2328 places, 1292/2192 transitions.
Stuttering acceptance computed with spot in 1445 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s1145 1) (LT s1157 1) (LT s1156 1) (LT s1155 1) (LT s1154 1) (LT s1161 1) (LT s1160 1) (LT s1159 1) (LT s1158 1) (LT s1149 1) (LT s1148 1) (LT s1147 1) (LT s1146 1) (LT s1153 1) (LT s1152 1) (LT s1151 1) (LT s1150 1) (LT s1173 1) (LT s1172 1) (LT s1171 1) (LT s1170 1) (LT s1177 1) (LT s1176 1) (LT s1175 1) (LT s1174 1) (LT s1165 1) (LT s1164 1) (LT s1163 1) (LT s1162 1) (LT s1169 1) (LT s1168 1) (LT s1167 1) (LT s1166 1) (LT s1186 1) (LT s1181 1) (LT s1180 1) (LT s1179 1) (LT s1178 1) (LT s1185 1) (LT s1184 1) (LT s1183 1) (LT s1182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 809 ms.
Product exploration explored 100000 steps with 33333 reset in 783 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 1292
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-06 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-06 finished in 7475 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((X(p1) U ((X(p1)&&p2)||X(G(p1))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2328 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2261 transition count 2192
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 174 place count 2154 transition count 2065
Iterating global reduction 1 with 107 rules applied. Total rules applied 281 place count 2154 transition count 2065
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 367 place count 2068 transition count 1979
Iterating global reduction 1 with 86 rules applied. Total rules applied 453 place count 2068 transition count 1979
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 497 place count 2046 transition count 1957
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 541 place count 2002 transition count 1893
Iterating global reduction 2 with 44 rules applied. Total rules applied 585 place count 2002 transition count 1893
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 606 place count 1981 transition count 1893
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 648 place count 1939 transition count 1851
Iterating global reduction 3 with 42 rules applied. Total rules applied 690 place count 1939 transition count 1851
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 731 place count 1898 transition count 1810
Iterating global reduction 3 with 41 rules applied. Total rules applied 772 place count 1898 transition count 1810
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 813 place count 1857 transition count 1769
Iterating global reduction 3 with 41 rules applied. Total rules applied 854 place count 1857 transition count 1769
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 895 place count 1816 transition count 1728
Iterating global reduction 3 with 41 rules applied. Total rules applied 936 place count 1816 transition count 1728
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 977 place count 1775 transition count 1687
Iterating global reduction 3 with 41 rules applied. Total rules applied 1018 place count 1775 transition count 1687
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1059 place count 1734 transition count 1646
Iterating global reduction 3 with 41 rules applied. Total rules applied 1100 place count 1734 transition count 1646
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1141 place count 1693 transition count 1605
Iterating global reduction 3 with 41 rules applied. Total rules applied 1182 place count 1693 transition count 1605
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1223 place count 1652 transition count 1564
Iterating global reduction 3 with 41 rules applied. Total rules applied 1264 place count 1652 transition count 1564
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1305 place count 1611 transition count 1523
Iterating global reduction 3 with 41 rules applied. Total rules applied 1346 place count 1611 transition count 1523
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 3 with 59 rules applied. Total rules applied 1405 place count 1592 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1406 place count 1591 transition count 1482
Iterating global reduction 4 with 1 rules applied. Total rules applied 1407 place count 1591 transition count 1482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1409 place count 1590 transition count 1481
Applied a total of 1409 rules in 1480 ms. Remains 1590 /2328 variables (removed 738) and now considering 1481/2192 (removed 711) transitions.
// Phase 1: matrix 1481 rows 1590 cols
[2021-05-11 06:03:49] [INFO ] Computed 152 place invariants in 8 ms
[2021-05-11 06:03:49] [INFO ] Implicit Places using invariants in 360 ms returned [147, 277, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 1127]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 362 ms to find 24 implicit places.
// Phase 1: matrix 1481 rows 1566 cols
[2021-05-11 06:03:49] [INFO ] Computed 128 place invariants in 7 ms
[2021-05-11 06:03:50] [INFO ] Dead Transitions using invariants and state equation in 705 ms returned []
Starting structural reductions, iteration 1 : 1566/2328 places, 1481/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1525 transition count 1440
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1525 transition count 1440
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1505 transition count 1400
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1505 transition count 1400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1485 transition count 1380
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1485 transition count 1380
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1465 transition count 1360
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1465 transition count 1360
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1445 transition count 1340
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1445 transition count 1340
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1425 transition count 1320
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1425 transition count 1320
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1405 transition count 1300
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1405 transition count 1300
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1385 transition count 1280
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1385 transition count 1280
Applied a total of 362 rules in 650 ms. Remains 1385 /1566 variables (removed 181) and now considering 1280/1481 (removed 201) transitions.
// Phase 1: matrix 1280 rows 1385 cols
[2021-05-11 06:03:51] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:03:51] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 1280 rows 1385 cols
[2021-05-11 06:03:51] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:03:52] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1385/2328 places, 1280/2192 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s426 1) (GEQ s474 1)), p1:(GEQ s1037 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-08 finished in 4349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 173 place count 2155 transition count 2067
Iterating global reduction 1 with 105 rules applied. Total rules applied 278 place count 2155 transition count 2067
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 362 place count 2071 transition count 1983
Iterating global reduction 1 with 84 rules applied. Total rules applied 446 place count 2071 transition count 1983
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 42 rules applied. Total rules applied 488 place count 2050 transition count 1962
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 531 place count 2007 transition count 1899
Iterating global reduction 2 with 43 rules applied. Total rules applied 574 place count 2007 transition count 1899
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 595 place count 1986 transition count 1899
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 636 place count 1945 transition count 1858
Iterating global reduction 3 with 41 rules applied. Total rules applied 677 place count 1945 transition count 1858
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 718 place count 1904 transition count 1817
Iterating global reduction 3 with 41 rules applied. Total rules applied 759 place count 1904 transition count 1817
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 800 place count 1863 transition count 1776
Iterating global reduction 3 with 41 rules applied. Total rules applied 841 place count 1863 transition count 1776
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 882 place count 1822 transition count 1735
Iterating global reduction 3 with 41 rules applied. Total rules applied 923 place count 1822 transition count 1735
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 964 place count 1781 transition count 1694
Iterating global reduction 3 with 41 rules applied. Total rules applied 1005 place count 1781 transition count 1694
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1046 place count 1740 transition count 1653
Iterating global reduction 3 with 41 rules applied. Total rules applied 1087 place count 1740 transition count 1653
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1128 place count 1699 transition count 1612
Iterating global reduction 3 with 41 rules applied. Total rules applied 1169 place count 1699 transition count 1612
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1209 place count 1659 transition count 1572
Iterating global reduction 3 with 40 rules applied. Total rules applied 1249 place count 1659 transition count 1572
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1289 place count 1619 transition count 1532
Iterating global reduction 3 with 40 rules applied. Total rules applied 1329 place count 1619 transition count 1532
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 3 with 59 rules applied. Total rules applied 1388 place count 1600 transition count 1492
Applied a total of 1388 rules in 1399 ms. Remains 1600 /2328 variables (removed 728) and now considering 1492/2192 (removed 700) transitions.
// Phase 1: matrix 1492 rows 1600 cols
[2021-05-11 06:03:53] [INFO ] Computed 153 place invariants in 8 ms
[2021-05-11 06:03:54] [INFO ] Implicit Places using invariants in 368 ms returned [148, 280, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 1137]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 369 ms to find 24 implicit places.
// Phase 1: matrix 1492 rows 1576 cols
[2021-05-11 06:03:54] [INFO ] Computed 129 place invariants in 5 ms
[2021-05-11 06:03:54] [INFO ] Dead Transitions using invariants and state equation in 687 ms returned []
Starting structural reductions, iteration 1 : 1576/2328 places, 1492/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1535 transition count 1451
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1535 transition count 1451
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1515 transition count 1411
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1515 transition count 1411
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1495 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1495 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1475 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1475 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1455 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1455 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1435 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1435 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1415 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1415 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1395 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1395 transition count 1291
Applied a total of 362 rules in 650 ms. Remains 1395 /1576 variables (removed 181) and now considering 1291/1492 (removed 201) transitions.
// Phase 1: matrix 1291 rows 1395 cols
[2021-05-11 06:03:55] [INFO ] Computed 129 place invariants in 5 ms
[2021-05-11 06:03:55] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 1291 rows 1395 cols
[2021-05-11 06:03:55] [INFO ] Computed 129 place invariants in 5 ms
[2021-05-11 06:03:56] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1395/2328 places, 1291/2192 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s147 1) (GEQ s195 1)) (AND (GEQ s846 1) (GEQ s890 1)) (LT s606 1)), p1:(AND (GEQ s147 1) (GEQ s195 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1400 steps with 4 reset in 5 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-09 finished in 4241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0) U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 68 places :
Implicit places reduction removed 68 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 2260 transition count 2192
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 175 place count 2153 transition count 2065
Iterating global reduction 1 with 107 rules applied. Total rules applied 282 place count 2153 transition count 2065
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 368 place count 2067 transition count 1979
Iterating global reduction 1 with 86 rules applied. Total rules applied 454 place count 2067 transition count 1979
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 498 place count 2045 transition count 1957
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 542 place count 2001 transition count 1893
Iterating global reduction 2 with 44 rules applied. Total rules applied 586 place count 2001 transition count 1893
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 607 place count 1980 transition count 1893
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 649 place count 1938 transition count 1851
Iterating global reduction 3 with 42 rules applied. Total rules applied 691 place count 1938 transition count 1851
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 733 place count 1896 transition count 1809
Iterating global reduction 3 with 42 rules applied. Total rules applied 775 place count 1896 transition count 1809
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 817 place count 1854 transition count 1767
Iterating global reduction 3 with 42 rules applied. Total rules applied 859 place count 1854 transition count 1767
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 901 place count 1812 transition count 1725
Iterating global reduction 3 with 42 rules applied. Total rules applied 943 place count 1812 transition count 1725
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 985 place count 1770 transition count 1683
Iterating global reduction 3 with 42 rules applied. Total rules applied 1027 place count 1770 transition count 1683
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1069 place count 1728 transition count 1641
Iterating global reduction 3 with 42 rules applied. Total rules applied 1111 place count 1728 transition count 1641
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1153 place count 1686 transition count 1599
Iterating global reduction 3 with 42 rules applied. Total rules applied 1195 place count 1686 transition count 1599
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1237 place count 1644 transition count 1557
Iterating global reduction 3 with 42 rules applied. Total rules applied 1279 place count 1644 transition count 1557
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1321 place count 1602 transition count 1515
Iterating global reduction 3 with 42 rules applied. Total rules applied 1363 place count 1602 transition count 1515
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 3 with 61 rules applied. Total rules applied 1424 place count 1582 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1425 place count 1581 transition count 1473
Iterating global reduction 4 with 1 rules applied. Total rules applied 1426 place count 1581 transition count 1473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1428 place count 1580 transition count 1472
Applied a total of 1428 rules in 1450 ms. Remains 1580 /2328 variables (removed 748) and now considering 1472/2192 (removed 720) transitions.
// Phase 1: matrix 1472 rows 1580 cols
[2021-05-11 06:03:57] [INFO ] Computed 150 place invariants in 8 ms
[2021-05-11 06:03:58] [INFO ] Implicit Places using invariants in 308 ms returned [273, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 710, 711, 712, 713, 714, 715, 1117]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 310 ms to find 22 implicit places.
// Phase 1: matrix 1472 rows 1558 cols
[2021-05-11 06:03:58] [INFO ] Computed 128 place invariants in 7 ms
[2021-05-11 06:03:58] [INFO ] Dead Transitions using invariants and state equation in 691 ms returned []
Starting structural reductions, iteration 1 : 1558/2328 places, 1472/2192 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1519 transition count 1433
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1519 transition count 1433
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 1500 transition count 1395
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 1500 transition count 1395
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 135 place count 1481 transition count 1376
Iterating global reduction 0 with 19 rules applied. Total rules applied 154 place count 1481 transition count 1376
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 173 place count 1462 transition count 1357
Iterating global reduction 0 with 19 rules applied. Total rules applied 192 place count 1462 transition count 1357
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 211 place count 1443 transition count 1338
Iterating global reduction 0 with 19 rules applied. Total rules applied 230 place count 1443 transition count 1338
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 249 place count 1424 transition count 1319
Iterating global reduction 0 with 19 rules applied. Total rules applied 268 place count 1424 transition count 1319
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 287 place count 1405 transition count 1300
Iterating global reduction 0 with 19 rules applied. Total rules applied 306 place count 1405 transition count 1300
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 325 place count 1386 transition count 1281
Iterating global reduction 0 with 19 rules applied. Total rules applied 344 place count 1386 transition count 1281
Applied a total of 344 rules in 636 ms. Remains 1386 /1558 variables (removed 172) and now considering 1281/1472 (removed 191) transitions.
// Phase 1: matrix 1281 rows 1386 cols
[2021-05-11 06:03:59] [INFO ] Computed 128 place invariants in 5 ms
[2021-05-11 06:03:59] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1281 rows 1386 cols
[2021-05-11 06:03:59] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:04:00] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1386/2328 places, 1281/2192 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s287 1), p1:(AND (GEQ s580 1) (GEQ s647 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 95 reset in 267 ms.
Product exploration explored 100000 steps with 94 reset in 311 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1386 transition count 1281
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 : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 94 reset in 265 ms.
Product exploration explored 100000 steps with 94 reset in 288 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 1386 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1386/1386 places, 1281/1281 transitions.
Performed 489 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 1386 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 490 place count 1386 transition count 1280
Performed 570 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 570 Pre rules applied. Total rules applied 490 place count 1386 transition count 1575
Deduced a syphon composed of 1059 places in 1 ms
Iterating global reduction 2 with 570 rules applied. Total rules applied 1060 place count 1386 transition count 1575
Discarding 717 places :
Symmetric choice reduction at 2 with 717 rule applications. Total rules 1777 place count 669 transition count 858
Deduced a syphon composed of 342 places in 1 ms
Iterating global reduction 2 with 717 rules applied. Total rules applied 2494 place count 669 transition count 858
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 407 places in 0 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 2559 place count 669 transition count 858
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 2645 place count 583 transition count 772
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 2731 place count 583 transition count 772
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 342 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2752 place count 583 transition count 814
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2773 place count 562 transition count 772
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2794 place count 562 transition count 772
Deduced a syphon composed of 321 places in 0 ms
Applied a total of 2794 rules in 311 ms. Remains 562 /1386 variables (removed 824) and now considering 772/1281 (removed 509) transitions.
[2021-05-11 06:04:03] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 772 rows 562 cols
[2021-05-11 06:04:03] [INFO ] Computed 128 place invariants in 5 ms
[2021-05-11 06:04:03] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Finished structural reductions, in 1 iterations. Remains : 562/1386 places, 772/1281 transitions.
Product exploration explored 100000 steps with 1435 reset in 616 ms.
Product exploration explored 100000 steps with 1434 reset in 553 ms.
[2021-05-11 06:04:04] [INFO ] Flatten gal took : 42 ms
[2021-05-11 06:04:04] [INFO ] Flatten gal took : 40 ms
[2021-05-11 06:04:04] [INFO ] Time to serialize gal into /tmp/LTL17705147323000863205.gal : 18 ms
[2021-05-11 06:04:04] [INFO ] Time to serialize properties into /tmp/LTL2920351153276926181.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17705147323000863205.gal, -t, CGAL, -LTL, /tmp/LTL2920351153276926181.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17705147323000863205.gal -t CGAL -LTL /tmp/LTL2920351153276926181.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(l32_14>=1)"))U(X("((l36_14>=1)&&(gl1_14_Y>=1))"))))))
Formula 0 simplified : !XX(F"(l32_14>=1)" U X"((l36_14>=1)&&(gl1_14_Y>=1))")
Detected timeout of ITS tools.
[2021-05-11 06:04:19] [INFO ] Flatten gal took : 47 ms
[2021-05-11 06:04:19] [INFO ] Applying decomposition
[2021-05-11 06:04:19] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2152242219685792858.txt, -o, /tmp/graph2152242219685792858.bin, -w, /tmp/graph2152242219685792858.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2152242219685792858.bin, -l, -1, -v, -w, /tmp/graph2152242219685792858.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 06:04:20] [INFO ] Decomposing Gal with order
[2021-05-11 06:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 06:04:20] [INFO ] Removed a total of 39 redundant transitions.
[2021-05-11 06:04:20] [INFO ] Flatten gal took : 111 ms
[2021-05-11 06:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-11 06:04:20] [INFO ] Time to serialize gal into /tmp/LTL8877695396970855362.gal : 16 ms
[2021-05-11 06:04:20] [INFO ] Time to serialize properties into /tmp/LTL9212645445305859321.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8877695396970855362.gal, -t, CGAL, -LTL, /tmp/LTL9212645445305859321.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8877695396970855362.gal -t CGAL -LTL /tmp/LTL9212645445305859321.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(i39.u124.l32_14>=1)"))U(X("((i24.u292.l36_14>=1)&&(i24.u282.gl1_14_Y>=1))"))))))
Formula 0 simplified : !XX(F"(i39.u124.l32_14>=1)" U X"((i24.u292.l36_14>=1)&&(i24.u282.gl1_14_Y>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15036042727079873685
[2021-05-11 06:04:35] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15036042727079873685
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15036042727079873685]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15036042727079873685] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15036042727079873685] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-10 finished in 39961 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (p1||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2192/2192 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2261 transition count 2192
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 173 place count 2155 transition count 2086
Iterating global reduction 1 with 106 rules applied. Total rules applied 279 place count 2155 transition count 2086
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 344 place count 2090 transition count 2021
Iterating global reduction 1 with 65 rules applied. Total rules applied 409 place count 2090 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 411 place count 2089 transition count 2020
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 455 place count 2045 transition count 1956
Iterating global reduction 2 with 44 rules applied. Total rules applied 499 place count 2045 transition count 1956
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 520 place count 2024 transition count 1956
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 562 place count 1982 transition count 1914
Iterating global reduction 3 with 42 rules applied. Total rules applied 604 place count 1982 transition count 1914
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 646 place count 1940 transition count 1872
Iterating global reduction 3 with 42 rules applied. Total rules applied 688 place count 1940 transition count 1872
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 730 place count 1898 transition count 1830
Iterating global reduction 3 with 42 rules applied. Total rules applied 772 place count 1898 transition count 1830
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 813 place count 1857 transition count 1789
Iterating global reduction 3 with 41 rules applied. Total rules applied 854 place count 1857 transition count 1789
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 895 place count 1816 transition count 1748
Iterating global reduction 3 with 41 rules applied. Total rules applied 936 place count 1816 transition count 1748
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 977 place count 1775 transition count 1707
Iterating global reduction 3 with 41 rules applied. Total rules applied 1018 place count 1775 transition count 1707
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1059 place count 1734 transition count 1666
Iterating global reduction 3 with 41 rules applied. Total rules applied 1100 place count 1734 transition count 1666
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1141 place count 1693 transition count 1625
Iterating global reduction 3 with 41 rules applied. Total rules applied 1182 place count 1693 transition count 1625
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1223 place count 1652 transition count 1584
Iterating global reduction 3 with 41 rules applied. Total rules applied 1264 place count 1652 transition count 1584
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 3 with 59 rules applied. Total rules applied 1323 place count 1633 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1324 place count 1632 transition count 1543
Iterating global reduction 4 with 1 rules applied. Total rules applied 1325 place count 1632 transition count 1543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1327 place count 1631 transition count 1542
Applied a total of 1327 rules in 1061 ms. Remains 1631 /2328 variables (removed 697) and now considering 1542/2192 (removed 650) transitions.
// Phase 1: matrix 1542 rows 1631 cols
[2021-05-11 06:04:37] [INFO ] Computed 173 place invariants in 9 ms
[2021-05-11 06:04:37] [INFO ] Implicit Places using invariants in 455 ms returned [147, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 1168]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 457 ms to find 44 implicit places.
// Phase 1: matrix 1542 rows 1587 cols
[2021-05-11 06:04:37] [INFO ] Computed 129 place invariants in 9 ms
[2021-05-11 06:04:38] [INFO ] Dead Transitions using invariants and state equation in 799 ms returned []
Starting structural reductions, iteration 1 : 1587/2328 places, 1542/2192 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1546 transition count 1501
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1546 transition count 1501
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1526 transition count 1461
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1526 transition count 1461
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1506 transition count 1441
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1506 transition count 1441
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1486 transition count 1421
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1486 transition count 1421
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1466 transition count 1401
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1466 transition count 1401
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1446 transition count 1381
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1446 transition count 1381
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1426 transition count 1361
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1426 transition count 1361
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1406 transition count 1341
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1406 transition count 1341
Applied a total of 362 rules in 448 ms. Remains 1406 /1587 variables (removed 181) and now considering 1341/1542 (removed 201) transitions.
// Phase 1: matrix 1341 rows 1406 cols
[2021-05-11 06:04:39] [INFO ] Computed 129 place invariants in 7 ms
[2021-05-11 06:04:39] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 1341 rows 1406 cols
[2021-05-11 06:04:39] [INFO ] Computed 129 place invariants in 7 ms
[2021-05-11 06:04:40] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1406/2328 places, 1341/2192 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s298 1) (GEQ s376 1)), p0:(OR (LT s342 1) (LT s449 1)), p2:(GEQ s316 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 98 reset in 302 ms.
Product exploration explored 100000 steps with 99 reset in 334 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1406 transition count 1341
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 : [(F (G (NOT p1))), (F (G p0)), (F (G (NOT p2))), (NOT p1), p0, (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p1)))
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1406 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1406/1406 places, 1341/1341 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1405 transition count 1341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 1404 transition count 1340
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1404 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1403 transition count 1339
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1403 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1402 transition count 1338
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1402 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1401 transition count 1337
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1401 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1400 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1400 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1399 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1399 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 1399 transition count 1334
Applied a total of 14 rules in 316 ms. Remains 1399 /1406 variables (removed 7) and now considering 1334/1341 (removed 7) transitions.
// Phase 1: matrix 1334 rows 1399 cols
[2021-05-11 06:04:42] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:04:42] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1334 rows 1399 cols
[2021-05-11 06:04:42] [INFO ] Computed 128 place invariants in 14 ms
[2021-05-11 06:04:43] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
// Phase 1: matrix 1334 rows 1399 cols
[2021-05-11 06:04:43] [INFO ] Computed 128 place invariants in 15 ms
[2021-05-11 06:04:43] [INFO ] Dead Transitions using invariants and state equation in 652 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1399/1406 places, 1334/1341 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 101 reset in 304 ms.
Product exploration explored 100000 steps with 99 reset in 326 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1399 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1399/1399 places, 1334/1334 transitions.
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 485 rules applied. Total rules applied 485 place count 1399 transition count 1334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 1399 transition count 1333
Performed 529 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 529 Pre rules applied. Total rules applied 486 place count 1399 transition count 1606
Deduced a syphon composed of 1014 places in 1 ms
Iterating global reduction 2 with 529 rules applied. Total rules applied 1015 place count 1399 transition count 1606
Discarding 676 places :
Symmetric choice reduction at 2 with 676 rule applications. Total rules 1691 place count 723 transition count 930
Deduced a syphon composed of 338 places in 0 ms
Iterating global reduction 2 with 676 rules applied. Total rules applied 2367 place count 723 transition count 930
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 401 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 2430 place count 723 transition count 930
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 2494 place count 659 transition count 866
Deduced a syphon composed of 337 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 2558 place count 659 transition count 866
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2579 place count 659 transition count 908
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2600 place count 638 transition count 866
Deduced a syphon composed of 337 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2621 place count 638 transition count 866
Deduced a syphon composed of 337 places in 0 ms
Applied a total of 2621 rules in 240 ms. Remains 638 /1399 variables (removed 761) and now considering 866/1334 (removed 468) transitions.
[2021-05-11 06:04:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 866 rows 638 cols
[2021-05-11 06:04:45] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:04:45] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 638/1399 places, 866/1334 transitions.
Product exploration explored 100000 steps with 1123 reset in 583 ms.
Product exploration explored 100000 steps with 1129 reset in 482 ms.
Starting structural reductions, iteration 0 : 1406/1406 places, 1341/1341 transitions.
Applied a total of 0 rules in 42 ms. Remains 1406 /1406 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
// Phase 1: matrix 1341 rows 1406 cols
[2021-05-11 06:04:46] [INFO ] Computed 129 place invariants in 7 ms
[2021-05-11 06:04:46] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 1341 rows 1406 cols
[2021-05-11 06:04:46] [INFO ] Computed 129 place invariants in 8 ms
[2021-05-11 06:04:47] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
// Phase 1: matrix 1341 rows 1406 cols
[2021-05-11 06:04:47] [INFO ] Computed 129 place invariants in 7 ms
[2021-05-11 06:04:48] [INFO ] Dead Transitions using invariants and state equation in 647 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1406/1406 places, 1341/1341 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620713089631

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-L00020M0002C001P001G001"
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-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, 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 r083-tall-162048876000949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 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 ;